Skip to main content

Data Structures

GFG Data Structures

Contents ​

Linked List​

  • Insertion
  • Deletion
  • Merging
  • Reversing
  • Cycle Detection
  • Hare and Tortoise
  • Douby Linked List
  • Circular Linked List
  • Stack, Queue Implementation
  • Merge Sort
  • Quick Sort
  • Floyd Algorithm

Linked List : LeetCode Tutorial

Stack​

  • Balanced Parentheses
  • Infix
  • Postfix
  • Prefix

Stack : LeetCode Tutorial

Queue​

  • Queue using 2 Stacks
  • Priority Queue
  • Double-ended Queue

Queue : LeetCode Tutorial

HashMaps​

  • Basics
  • Collision Handling

HashMaps : LeetCode Tutorial

Heaps​

  • Push
  • Poll

Trees​

  • Traversal
  • Insertion
  • Deletion
  • Search
  • Top/Left/Right/Bottom -View
  • Mirror Image
  • Self Balancing Trees
  • Extra: Huffman

Graphs​

  • Depth First Search
  • Breadh First Search
    • Shortest Path in Unweighted Graph
  • Connected Components
  • Cycle Detection
  • Union
  • Shortest Path Algorithms
    • Dijkstra
    • Bellman Ford
    • Extra: Floyd Warshall
  • Minimum Spanning Tree
    • Prim's
    • Kruskal