binary search tree binary search trees (bstsare very simple to understand we start with root node with value xwhere the left subtree of contains nodes with values and the right subtree contains nodes whose values are > each node follows the same rules with respect to nodes in their left and right subtrees bsts are of interest because they have operations which are favourably fastinsertionlook upand deletion can all be done in (log ntime it is important to note that the (log ntimes for these operations can only be attained if the bst is reasonably balancedfor tree data structure with self balancing properties see avl tree defined in ss in the following examples you can assumeunless used as parameter alias that root is reference to the root node of the tree figure simple unbalanced binary search tree