binary search trees binary search tree (bstis special kind of binary tree that isit is tree that is structurally binary tree functionallyit is tree that stores its nodes in such way to be able to search through the tree efficiently there is structure to bst for given node with valueall the nodes in the left sub-tree are less than or equal to the value of that node alsoall the nodes in the right sub-tree of this node are greater than that of the parent node as an exampleconsider the following treethis is an example of bst testing our tree for the properties of bstyou realize that all the nodes in the left sub-tree of the root node have value less than likewiseall the nodes in the right sub-tree have value that is greater than this property applies to all the nodes in bstwith no exceptionsdespite the fact that the preceding figure looks similar to the previous figureit does not qualify as bst node is greater than the root node howeverit is located to the left of the root node node is to the right sub-tree of its parent node which is incorrect