(Latest Revision: 12/01/2000)
Week 13 Notes for CS 2500 -- Fall 2000
Monday, November 27
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- Program #3 was corrected and returned.
- Due date for the final version of program #4
is Friday, Dec 01.
- Note that there is only a weekend between
the final due date for program #4 and the
first due date for program #5. You see you
must get started on program #5 before the
final due date for program #4!
- Discuss deletion in binary trees.
- Examine (recursive) bst deletion programming code.
Wednesday, November 29
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- Finish examining code for BST deletion
- Go over assignment #5
-
Friday, December 01
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- Discuss traversal in BT's
- Review ideas for the functions required in assignment #5.
- Array-based representation of BT and BST
- Pointer-based representation of BT and BST
- Efficiency of search in pointer-based BST: worst
case, best case, average case.
-