Topics

• Abstract data types
• Linked lists
• node and list classes
• operations
• traverse, insert, delete, etc.
• doubly linked lists
• circular linked lists
• Time analysis
• choosing representative operation and counting
• Big Oh
• Generics
• using references to Object
• <T>, etc.
• raw types
• constraining types and "extends Comparable"
• Stacks
• implementations: array and linked list
• the system stack and stack frames
• Queues
• implementations: array and linked list
• Binary trees
• generic nodes
• traversals
• Binary search trees
• operations: insert, delete, search
• AVL trees
• insert and rebalance operations
• Heaps
• tree and array representations
• pushdown and buildheap
• heapsort
• priority queues
• Hashing
• hash functions
• collision resolution methods
• chaining
• open addressing methods
• linear probing & clustering
• double hashing
• quadratic probing
• tombstones
• buckets
• direct access (hashed) files
• extendable hash tables
• B-trees
• definition of B-tree
• insert operation: rotating, splitting nodes
• delete operation: rotating, merging nodes
• B+ trees and indexed-sequential files
• Graphs
• breadth-first and depth-first search
• DFS and BFS spanning trees