Week 14 Notes for CS 2500 -- Fall 2000

• Take Roll.
• Check out this week's schedule
• Announcement(s)
• Discuss traversal in BT's
  • Discuss the use of a function parameter in a traversal
  • Applications of inorder traversal: listing elements in order, treesort, treeprinting
  • Applications of postorder traversal: tree destructor and generating postfix expressions.
  • Applications of preorder traversal: tree copy and generating prefix expressions.

• Take Roll.
• Check out this week's schedule
• Announcement(s)
• Discuss the use of a function parameter in a traversal
• Array-based representation of BT and BST
• Pointer-based representation of BT and BST
• Pointer-based using table index
• Efficiency of search in pointer-based BST: worst case, best case, average case.

• Take Roll.
• Check out this week's schedule
• Announcement(s)