Heap
Last updated
What is Heap?
A heap is a type of data structure in computer science that is like a tree, where each parent node is always bigger (in a max heap) or smaller (in a min heap) than its child nodes.
Free resources to learn Heap
- ArticleHeap Data Structure
- VideoHeap Data Structure
- VideoHeaps and Priority Queues
More in stage 11: Advanced Data Structures
- Advanced Data Structures
- Trie
- Segment Trees
- Fenwick Trees
- Disjoint Set (Union-Find)
- Suffix Trees and Arrays
- Binary Trees
- Tree Traversal
- Search Algorithms
- Binary Search Trees
- In-Order Traversal
- Breadth First Search
- AVL Trees
- Pre-Order Traversal
- Depth First Search
- B-Trees
- Post-Order Traversal
- Search Algorithms
- Breadth First Search
- Depth First Search
- Shortest Path Algorithms
- Dijkstra's Algorithm
- Bellman-Ford Algoritm
- A* Algorithm
- Minimum Spanning Tree
- Prim's Algorithm
- Kruskal's Algorithm
Heap: common questions
Can I learn Heap in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Heap in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Heap tutorial for beginners?
It is lesson 68 of 107 in the free Data Structures & Algorithms roadmap, in stage 11, Advanced Data Structures. If you are new to Data Structures & Algorithms, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.