A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Generally, Heaps can be of two types:

**Max-Heap:** In a Max-Heap the key present at the root node must be greatest among the keys present at all of it's children. The same property must be recursively true for all sub-trees in that Binary Tree.

**Min-Heap:** In a Min-Heap the key present at the root node must be minimum among the keys present at all of it's children. The same property must be recursively true for all sub-trees in that Binary Tree.

**
Binary Heap :**

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.

- Introduction to Tree Data Structure
- Binary Tree in Data structure
- Binary search Tree in Data structure
- AVL tree in data structure
- Complete binary search in data structure
- Full Binary Tree in Data structure
- Heap Tree in Data Structure
- Minimum Spanning Tree
- Introduction to graph
- DFS algorithms
- BFS algorithms

R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!