Introduction to Data Structures
- What are Data Structures?
- Importance of Data Structures in Computer Science
- Classification of Data Structures
- Basic Operations on Data Structures
Arrays
- Introduction to Arrays
- One-Dimensional Arrays
- Multi-Dimensional Arrays
- Array Operations
- Sorting Algorithms (Bubble, Selection, Insertion)
Linked Lists
- Introduction to Linked Lists
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Insertion, Deletion, and Traversal in Linked Lists
Stacks
- Introduction to Stacks
- Stack Operations (Push, Pop, Peek)
- Applications of Stacks (Expression Evaluation)
- Implementing Stacks using Arrays and Linked Lists
Queues
- Introduction to Queues
- Queue Operations (Enqueue, Dequeue, Front, Rear)
- Circular Queue
- Priority Queue
- Implementation of Queues using Arrays and Linked Lists
Trees
- Introduction to Trees
- Binary Tree
- Binary Search Tree (BST)
- Tree Traversals (Inorder, Preorder, Postorder)
- AVL Trees and Balancing
Graphs
- Introduction to Graphs
- Representation of Graphs (Adjacency Matrix, Adjacency List)
- Graph Traversal (BFS, DFS)
- Shortest Path Algorithms (Dijkstra, Bellman-Ford)
- Applications of Graphs
Hashing
- Introduction to Hashing
- Hash Functions
- Collision Resolution Techniques (Linear Probing, Chaining)
- Applications of Hashing
Heaps
- Introduction to Heaps
- Binary Heap
- Heap Operations (Insertion, Deletion)
- Applications of Heaps (Priority Queue)
Advanced Topics
- Trie Data Structure
- Segment Trees
- Suffix Trees
- Disjoint Set Union (Union-Find)