BuildTree for BSTs

• Suppose the data 1, 2, 3, 4, 5, 6, 7, 8, 9 is inserted into an initially empty BST:

  • in order
  • in reverse order
  • median first, then left median, right median, etc.

Previous slide

Next slide

Back to first slide

View graphic version