A heap tree is a complete binary tree in which data values stored in any node is greater than or equal to the value of each of its children. There is only restriction between parent and its children and not within the left or right subtree...

A binary search tree abbreviated as BST is a special form of binary tree whose nodes are arranged in such a way that for every node N, the values contained in all the nodes in its left subtree are less than the value contained in node...

A binary tree is a special form of tree in which a node can have atmost two children. The two children of each node in a binary tree are called the left child and right child corresponding to their position in a binary tree representation....

A Tree is a hierarchical structure that we are already familiar with in our daily life. It is an efficient means to maintain and manipulate data in numerous examples such as a family tree, corporate management structure, military organization...