Week 13 Notes for CS 2500, Section 001 -- Spring 2001

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
• Discuss Code for the following operations in a BST:
  • Retrieval by key value
  • Insertion by key value
  • Deletion by key value
    • -- when the delete node is a leaf
    • -- when the delete node has one child
    • -- when the delete node has two children

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
• Discuss ideas for implementing functions assigned in program #5
• Discuss Code for the following operation in a BST:
  • Deletion by key value
    • -- when the delete node is a leaf
    • -- when the delete node has one child
    • -- when the delete node has two children

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
  • I will pass out course evaluations for you to fill out -- return to the envelope appropriate to your section
  • I need someone to bring the forms to the Academic Senate office down the hall.
• Finish up discussion of ideas for implementing functions assigned in program #5
• Discuss array-based representation of BT and BST
• Discuss efficiency of search in pointer-based BST: worst case, best case, average case
• 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.