Binary Search Trees
A binary search tree is a binary tree that is sorted from left to right.
+ This way of sorting the tree makes an in-order traversal always visit the elements in sorted order.
Types of Binary Search Trees
The simplest kind of binary search tree is shown here but there are more complicated forms.
A self-balancing binary search tree is one that maintains a shape property
by balancing itself during insertion and remove operations. The common examples of
self-balancing binary search trees include AVL-trees,
and Red-Black trees.
Construction of a Binary Search Tree
Use the following form to build a binary search tree out of a sequence of insertions.
Note that this is a regular binary search tree and not balanced like AVL or Red-Black so the insert operation will not move any nodes.
Related Resources
Comments
|