Lecture Synopsis

10. Improving Performance of Lists

• Lists vs. Binary Search Trees
  • Worst case scenario for BST is equivalent to a list
  • Definitions
    • External vertex
    • Internal vertex
    • Path
    • Path length
    • Internal path length
    • External path length
    • Augmented binary tree
  • Average case behavior of Randomly Constructed Binary Search Trees
• Improving Performance of Lists
  • Binary Search
  • Self-Organizing Lists
    • Move-to-front
    • Transpose
    • Frequency count
  • Skip Lists