A binary tree is a tree in which no node can have more than two children. The property that makes a binary tree into a binary search tree is that for every node, X, in the tree, the values of all the keys in its left subtree are smaller than the key value in X, and the values of all the keys in its right subtree are larger than the key value in X.

An important application of binary trees is their use in searching.

Here are the operations which are possible on binary search tree ADT (abstract data type),

1)Make Empty

2)Find

3)FindMin

4)FindMax

5)Insert

6)Delete

Please refer http://www.refcode.net/2013/02/binary-search-trees.html

### Like this:

Like Loading...

*Related*

…but you dont balance the tree 😦

21 December 2007at8pmgoing to cover them (balanced, self adjusting trees) next..

21 December 2007at8pmI like the way you draw the trees..

23 December 2007at5pmYeah! the trees on console are pretty nice

24 December 2007at1pm@Chadwick, I’d balanced the trees now 🙂

here is the link..

http://www.cpp-programming.net/c-tidbits/balanced-avl-binary-search-trees/

11 January 2008at6pmyour articles helping me a lot, thanks for all your posts, by the way, your comment box not visible prproperly, let the moderator of this site know about this issue..

18 January 2008at2pmThanks for letting me know, I’d fixed it. thanks

22 January 2008at11pmvery clear and helpful article on binary trees.

10 June 2009at4amhai !!! want to solve this small issue !!

i have a + operator in the Root of the tree

and the child on the left has 5 and child on the right has 6

i want the answer to be 11 i want to use root->info to solve this problem

any solution for this !!!!

25 July 2009at4pm