Saved Bookmarks
| 1. |
What Is An Avl Tree? |
|
Answer» AVL trees are height balancing binary search tree. AVL tree checks the height of LEFT and RIGHT sub-trees and assures that the difference is not more than 1. This difference is called BALANCE Factor. BalanceFactor = height(left-sutree) − height(right-sutree) AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree) |
|