| | | | | next -> |

Next Steps

  • Height Balanced Trees
    1. AVL Trees [Adelson-Velskii and Landis, 1962]
    2. Classic Red-Black Trees [Guibas and Sedgewick, 1978]
    3. Left-Leaning Red-Black Trees [Sedgewick, 2007]
  • Tree Iterators
    1. Needed for stop 'n go Traversal
    2. Needed for pointers (LowerBound, etc)
    3. Use Navigators

State-of-the-art Sorted Set and Sorted Table classes


| next -> | Top of Page | 12. Binary Search Trees - 27 of 27