prog home

graph LR
    A[Data Structures and Algorithms] --> B[Data Structures]
    A --> C[Algorithms]

    B --> D[Linear Data Structures]
    B --> E[Non-Linear Data Structures]

    D --> F[Array]
    D --> G[Linked List]
    D --> H[Stack]
    D --> I[Queue]
    D --> J[Deque]
    D --> K[Circular Queue]
    D --> L[Skip List]

    E --> M[Tree]
    E --> N[Graph]
    E --> O[Heap]
    E --> P[Trie]
    E --> Q[Disjoint Set]
    E --> R[Suffix Tree]

    M --> S[Binary Tree]
    M --> T[Binary Search Tree]
    M --> U[AVL Tree]
    M --> V[Red-Black Tree]
    M --> W[B-Tree]
    M --> X[Segment Tree]
    M --> Y[Interval Tree]
    M --> Z[Fenwick Tree]
    M --> AA[KD-Tree]

    N --> AB[Directed Graph]
    N --> AC[Undirected Graph]
    N --> AD[Weighted Graph]
    N --> AE[Unweighted Graph]
    N --> AF[DFS]
    N --> AG[BFS]
    N --> AH[Dijkstra's Algorithm]
    N --> AI[Bellman-Ford Algorithm]
    N --> AJ[Floyd-Warshall Algorithm]
    N --> AK[Kruskal's Algorithm]
    N --> AL[Prim's Algorithm]
    N --> AM[Topological Sorting]

    O --> AN[Min-Heap]
    O --> AO[Max-Heap]

    C --> AP[Sorting]
    C --> AQ[Searching]
    C --> AR[Dynamic Programming]
    C --> AS[Greedy Algorithms]
    C --> AT[Divide and Conquer]
    C --> AU[Backtracking]
    C --> AV[String Algorithms]
    C --> AW[Mathematical Algorithms]
    C --> AX[Amortized Analysis]
    C --> AY[Approximation Algorithms]
    C --> AZ[Randomized Algorithms]
    C --> BA[Parallel Algorithms]
    C --> BB[Cache-Oblivious Algorithms]
    C --> BC[Streaming Algorithms]

    AP --> BD[Bubble Sort]
    AP --> BE[Selection Sort]
    AP --> BF[Insertion Sort]
    AP --> BG[Merge Sort]
    AP --> BH[Quick Sort]
    AP --> BI[Heap Sort]
    AP --> BJ[Shell Sort]
    AP --> BK[Radix Sort]
    AP --> BL[Counting Sort]
    AP --> BM[Bucket Sort]

    AQ --> BN[Linear Search]
    AQ --> BO[Binary Search]
    AQ --> BP[Exponential Search]
    AQ --> BQ[Interpolation Search]
    AQ --> BR[Ternary Search]

    AR --> BS[Memoization]
    AR --> BT[Tabulation]
    AR --> BU[LCS]
    AR --> BV[LIS]
    AR --> BW[Matrix Chain Multiplication]

    AS --> BX[Knapsack Problem]
    AS --> BY[Huffman Coding]
    AS --> BZ[Activity Selection Problem]
    AS --> CA[Kruskal’s Algorithm]
    AS --> CB[Prim’s Algorithm]

    AT --> CC[Merge Sort]
    AT --> CD[Quick Sort]
    AT --> CE[Karatsuba Algorithm]
    AT --> CF[Strassen’s Algorithm]

    AU --> CG[Sudoku Solver]
    AU --> CH[Subset Sum]
    AU --> CI[N-Queens Problem]
    AU --> CJ[Hamiltonian Cycle]
    AU --> CK[Knight’s Tour]

    AV --> CL[KMP]
    AV --> CM[Rabin-Karp]
    AV --> CN[Boyer-Moore]
    AV --> CO[Z Algorithm]

    AW --> CP[Euclidean Algorithm for GCD]
    AW --> CQ[Sieve of Eratosthenes]
    AW --> CR[Matrix Exponentiation]