Discrete Stuctures and Programming II

Topics covered include: The tree ADT, traversals, binary trees, proper binary trees, Java implementations, array-based representation of binary tress, priority queue and sorting, heap and its operations, heap sorting, button-up heap construction, analysis, adaptable priority queue with heap implementation, maps, hash tables, double hashing and rehash, average-case analysis of performance, dictionaries, ordered dictionaries, binary search trees, BST-sorting, quick sort, merge-sort, skip lists, case- analysis by probability, AVL trees, (2, 4) trees, analysis, red black trees. Credit cannot be held for both this course and 62:206.