Binary Search Tree

This is a discussion on Binary Search Tree within the C++ Programming forums, part of the General Programming Boards category; How do you split a BST where the value X may or may not be in the tree into BST ...

  1. #1
    Registered User
    Join Date
    Nov 2005
    Posts
    12

    Binary Search Tree

    How do you split a BST where the value X may or may not be in the tree into BST q,r , given that all the values in tree Q is less than or equal to X and tree r is greater than or equal to X ?

  2. #2
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,452

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Replies: 0
    Last Post: 11-04-2006, 10:07 AM
  2. BST (Binary search tree)
    By praethorian in forum C++ Programming
    Replies: 3
    Last Post: 11-13-2005, 08:11 AM
  3. searching and insertion in a binary search tree
    By galmca in forum C Programming
    Replies: 1
    Last Post: 03-26-2005, 04:15 PM
  4. binary search and search using binary tree
    By Micko in forum C++ Programming
    Replies: 9
    Last Post: 03-18-2004, 09:18 AM
  5. Request for comments
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-02-2004, 09:33 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21