
10.1 AVL TREES
During the discussion on binary search trees (BST) in Chapter 7, it was appreciated that BST is an excellent
tool for fast search operations. It was also highlighted that if the data input to BST is not properly planned,
then there is every likelihood that the BST may end up in a skewed binary tree or at least a lopsided binary
tree wherein one subtree has more height than the other subtree. Consider the data given below:
Cat Family 5 {Lion, Tiger, Puma, Cheetah, Jaguar, Leopard, Cat, Panther, Cougar, Lynx, Ocelot}
This data can be provided in any combination and the resultant BSTs would be different from each
other depending u ...