COSC 350: Data Structures
April 17, 2009

Projects

Wikipedia and Sorting Algorithms: Good content with nice animations, but beware of variant algorithims that differ from those presented in class. Variants aren't wrong, but may have different performance characteristics from those in class and what you are asked about on tests. For example, the verison of quick sort presented in class is in place but not stable. One of the version of quicksort in Wikipedia is stable but not in place.

Priority Queues Recap

Build from data, i.e., insert an item
Delete an item
Draw from array
Give array from tree
Search for item in array or tree
Locate parent or child given array

Binary Search Trees Revisited

Draw, Search, Create (Insert Node), Delete Node

Homework

Monday, April 20:

1. Construct a heap tree using the data 5, 1, 8, 3, 7, 2, 0, 4, 6, 9 by inserting the data (in the order they are given) into the heap one item at a time. Show the tree at each stage as it is developed.

2. Give the array that corresponds to the final tree.

This page was created by Joe Sloan.
It was last modified on or after: 20 April 2009
Send mail to: sloanjd@wofford.edu