Heap vs Binary Tree

Today we are going to compare two non linear data structures binary trees and heaps since both are non liner there tend to be confusion regarding both of these usually we will try to remove these confusion.

See the summary table of differences at the end of this article

IntroductionBinary tree

A binary tree is a non-Linear data structure in which each node can have either 0, 1 or 2 child nodes each. Each node consists of

Data portionPointer to left childPointer to right child

Depending u...