previous | start | next

Balanced Binary Search Trees

So what should it mean for a BST to be balanced?

There are several possibilities that all lead to all paths in the tree having length at most proportional to log(N).

Two different kinds of balanced BSTs using slightly different definitions of balanced are:



previous | start | next