Search tree are data strucure that support many dynamic set
operations ,including SEARCH, MINIMUM,
MAXIMUM,PREDECCSOR,SUCCESSOR,INSERT AND DELETE.
Thus a search tree can be used both as a dictionary and as a priority
queue.Basic operations in a binary search tree take time propotional to the
height of the tree.A binary search tree is organised ,as the name suggests ,in a
binary tree .such a tree can be repsented by a linked data structure in which
each node is an object .
In addition to a key field and satellite data ,each nodes contain fields.the keys
in a binary search tree always sorted in a way as to satisfy the binary search
tree property.For any node x,the keys in the left subtree of x are at most key
[x],and the keys in the right subtree of x are at least key [x].different binary
search trees can represent the same set of values.
The worst case running time for most search tree operations is propotional
to the height of the tree.The root node is the only node in the tree whose
parents fields is nil.the keys in a binary search tree always sorted in such a
way as to satisy the binary searchtree property.
The binary search tree property allows us to print out all the keys in a binary
search tree in sorted order by a simple recursive algorithm called an indoor
tree walk.the algorithm is so named because the key of the root ofa subtree is
printed between the values in its left subtree and those in its right subtree.Discount coupons
