PPT Slide

An AVL Tree (or Balanced BST) is a BST which

satisfies the following condition:

• For every node in the BST, the maximum path

lengths in the left subtree and right subtree differ

by no more than one.

Previous slide

Next slide

Back to first slide

View graphic version