CS350: Data Structures Class Notes
Week 10, Class 28: Wednesday, November 5, 2008
Today we talked briefly about testing a sort routine for stability by using a dataset
composed of tuples and the sorting only on the first item using something like:
def newCmp(tuple1, tuple2):
return cmp(tuple1[0],tuple2[0])
Next, we discussed an ADT for a priority queue and went over the algorithms for
building, removing the root, and removing an arbitrary node. The key to removal is
restore completeness first, then the heap property by bubbling nodes.
Finally, we talked briefly about the ideas behind skip lists.
Homework for Friday: For the data: 5,1,9,3,7,2,4,8
a) Show the BST & heap tree
b) Show each after deleting 7
c) Show each after deleting