You are currently browsing the tag archive for the ‘Binary search tree’ tag.
In Binary search tree we arrange the elements such that the root value of binary search tree is greater than the left sub tree value of the binary search tree and the value of the right sub tree is greater than the root value of the binary search tree.
This is program on Binary search tree :-
