Balanced Binary Search Tree

• balance of a node in a tree

  • height(left)-height(right)

• a tree is balanced if  for each node, its balance is 0, -1, or 1.

Previous slide

Next slide

Back to first slide

View graphic version