Unit-1: Linear Data Structures
- Array implementation
- Linked list implementation
- Singly linked list
- Doubly linked list
- Circular linked list
- Polynomial manipulation
Unit-2: Stacks and Queues
- Stack implementation using linked list
- Infix to postfix expression conversion
- Evaluation of arithmetic expressions
- Queue implementation
- Circular queue
- Priority queue
- Deque (Double-ended queue)
Unit-3: Trees
- Tree traversals
- Binary Search Tree (BST)
- AVL tree
- B-tree and B+ tree
Unit-4: Sorting, Searching & Hashing Techniques
- Searching
- Linear search
- Binary search
- Sorting
- Selection sort
- Insertion sort
- Merge sort
- Hashing and collision resolution techniques
Unit-5: Graphs
- Graph traversal methods
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Prim’s and Kruskal’s algorithms
- Dijkstra’s algorithm
