A Survey on Different Method of Balancing a Binary Search Tree

Abstract

-This paper empirically examines the various ways of balancing the binary search tree. Since we know how to construct a binary search tree the only thing left is to keep it balanced. Obviously, we will need to re-balance the tree on each insert and delete, which will make this data structure more difficult to maintain compared to non-balanced search trees, but searching into it will be significantly faster.