Beauty is Only ?(log n) Deep

• Binary Search Trees are fast if they’re shallow:

  • perfectly complete
  • perfectly complete except the one level fringe (like a heap)
  • anything else?

What matters here?

Problems occur when one

branch is much longer

than the other!

Previous slide

Next slide

Back to first slide

View graphic version