Description: Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If the left subtree is not empty, then the value of all the nodes of the left subtree are less than the value of its root (2) If the right subtree is not empty, then the right sub-tree node values are greater than the value of its root (3) left and right subtree respectively, binary sort tree
To Search:
File list (Check if you may need any files):
adt tree.cpp
Download