Implemented Data Structure and Related Algorithm

• Arrays
  • Array related algorighm
• Linked list
  • Linked list related algorithm
• Binary Search
  • Basic binary search
  • Search ceiling
  • Search lower
  • Turning array search
  • Rotated array search
• Graphs
  • Adjacent matrix based operations
  • Adjacent list based operations
  • Depth first search
  • Breadth first search
  • Minimum spanning tree
    • Kruskal MST
    • Prim KST
  • Shortest path search
    • Dijkstra SP
    • Floyd Warshall SP
    • Un-weighted graph SP
• Hashing
• Heap (Priority Heap)
  • Binary heap
  • Binomial heap
  • D-heap
  • Fibonacci heap
  • Indexed heap
  • Leftist heap
  • Pair heap
• Queue
  • Array based queue
  • Linked list based queue
  • Blocking queue
  • Circular queue
  • Queue with max value
  • Queue with min value
  • Queue implemented with two stacks
  • Queue sorting
  • Three queue in one array
• Stack
  • Array based stack
  • Linked list based stack
  • Stack with max value
  • Stack with min value
  • Stack implemented with two queue
  • Stack sorting
  • Three stacks in one array
• Sort
  • Bubble sorting
  • Bucket sorting
  • Heap sorting
  • Insertion sorting
  • Merge sorting
  • Quick sorting
  • Selection Sorting
  • Radix sorting
• Strings
  • String related algorithm
• Tree
  • Binary search tree
    • BST related algorithms
  • Balanced binary tree
    • AVL tree
    • Treap (tree with heap)
    • Red-black tree
    • Splay tree
  • K-ary tree
• Big number algorithm
  • Add operation
  • Substract operation
  • Multiply operation
  • Divide operation
  • Mod operation