GFG App
Open App
Browser
Continue

# Comparison between Heap and Tree

## What is Heap?

A Heap is a special Tree-based data structure in which the tree is a complete binary tree.

### Types of Heap Data Structure:

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 its 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 its children. The same property must be recursively true for all sub-trees in that Binary Tree.

## What is a Tree?

A tree is non-linear and has a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value and a list of references to other nodes (the “children”).

### Types of Tree data structures:

Usually, the different types of tree data structures are as follows:

• Binary tree: A node of a binary tree can have a maximum of two child nodes.
• Binary search tree: As the name implies, binary search trees are used for various searching and sorting algorithms. The examples include AVL tree and the red-black tree. It is a non-linear data structure. It shows that the value of the left node is less than its parent, while the value of the right node is greater than its parent.

## Comparison between heap and tree:

Related Articles:

My Personal Notes arrow_drop_up