Ordered Trees (8)

Michael L. Littman

September 25th, 1997

• ANNOUNCEMENTS
• DYNAMIC PROBLEMS
  • Dynamic Problems
  • Elevator Simulation
  • Dynamic Operations
  • Customer Lists
  • Dynamic Operations
  • Ordered Trees
  • Representing Trees
• HEAPS
  • Priority Queue
  • Priority Queue for Elevator
  • Heap Definition
  • Some Properties of Heaps
  • Representing a Heap
  • Maintaining the Heap Property
  • Down-Heapify
  • Up-Heapify
  • Building a Heap from a List
  • Build-Heap Analysis
  • Extract Min
  • Insert
  • Heap Sort
• BINARY SEARCH TREES
  • Binary Search Tree Definition
  • Some Properties of Binary Search Trees
  • Finding a Key
  • Listing Items in Order
  • Where is the Successor?
  • Successive Insertions and Deletions
• LISTING LARGEST ELEMENTS
• HOMEWORK
  • Homework 4