(Latest Revision: 05/14/2001)
Week 13 Notes for CS 2500, Section 002 -- Spring 2001
CS 2500, Section 002, Tuesday, May 15, 2001
- Look at Upcoming Schedule
- Class starts at 09:40. I take roll at 09:50
- 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
- Discuss ideas for implementing functions assigned in program #5
-
CS 2500, Section 002,Thursday, May 17, 2001
- Look at Upcoming Schedule
- Class starts at 09:40. I take roll at 09:50
- Announcement(s)
- Evaluations??
- Quiz next Tuesday
-
- 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.
-