Data Structures

  • [1] Arrays

    • Simple array
    • Multi-dimensional array
  • [2] Stacks

    • Stack representation
    • Stack operations
    • Recursion: Towers of Hanoi, Fibonacci series
  • [3] Queues

    • Queue representation
    • Queue operations
    • Double-ended queue
    • Circular queue
  • [4] Linked Lists

    • Linked list representation
    • Linked list operations
    • Doubly linked list
    • Circular linked list
  • [5] Trees

    • Binary trees
    • Array representation of binary trees
    • General (rooted) trees
  • [6] Binary search trees (BST)

    • Insertion and deletion
  • [7] Heaps

    • Priority queue
    • Build heap
    • Insertion and deletion
  • Balanced binary search trees

    • Red-Black trees
    • AVL trees
  • Augmenting data structures

    • Interval tree
    • Segment tree
  • Advanced data structures

    • B-Trees
    • Fibonacci Heaps
    • Union-Find (Disjoint Sets)
Go to Home