AVL Property

• If N is a node in a binary tree, node N has AVL property if the heights of the left sub-tree and right sub-tree are equal or if they differ by 1.

• Lets look at some examples.

Previous slide

Next slide

Back to first slide

View graphic version