Data Structure and Algorithms
Time Complexity Analysis: Big-Oh, Big-Omega, and Big-Theta notations. Data Types and Abstract Data Types (ADTs):Various types of ADTs such as List, Set, Queue, Circular Queue, Trees, Graphs, etc.2-3 Trees, Red-Black Trees, Binary Trees, Search Trees, N-ary Trees. Graph Traversals and Searching:BFS (Breadth-First Search), DFS (Depth-First Search), Spanning Tree, Minimum Spanning Tree, Paths, Shortest Paths, TSP (Traveling Salesman Problem). Data Structures for Maintaining Ranges, Intervals, and Disjoint Sets with Applications.

