Implementing Sample ADT, Templates – Stacks and Queues: Array implementation, Applications – Vector, Lists, using these STLs for other implementations -Linked list: Singly
and Doubly Linked Lists Implementation, Linked Stacks, D-Queue, Circular Queue – Implementing STL: Sequences, Iterators – Trees: Binary search tree, Priority Queue, Heaps – Graphs: Graph Representations, Traversals (BFS, DFS) – Hashing: Hash Table creation, creating hash functions, dynamically resizing hash tables.