[prev] 73 [next]

Summary

  • Binary search tree (BST) data structure
  • Tree traversal
  • Basic BST operation: insertion, join, deletion, rotation
  • Randomised at-leaf/at-root insertion

  • Suggested reading:
    • Sedgewick, Ch. 12.5-12.6, 12.8