Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction, Performance Analysis,Performance Measurement
Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, Representationof Multidimensional Arrays
Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation ofExpressions, Multiple Stacks and Queues.
Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials, Additional List operations, Sparse Matrices, Doubly Linked Lists
Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps. Binary Search Trees,Selection Trees, Forests, Representation of Disjoint Sets, Counting Binary Trees, The Graph Abstract Data Type.
Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps, Pairing Heaps.
Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees.