HeightBalancedBST

Self Balancing Binary Search Tree

Since most of the functions on Binary Tree involves Height of the tree, we try to minimize the height by self balancing it. These are simple techniques to make it self balance.

Examples of this

1. Redblack tree ~ 2-4 tree

2. AVL Tree

The benefit of self balancing binary search tree is that it provides height equals logn.