Tutorial by Examples

Min-Heap 1 / \ 2 3 / \ / \ 4 5 6 7 The above tree is a Min-Heap since the root is the minimum among all the nodes present in the tree.The same property is followed by all the nodes in the tree. Max-Heap 7 / \ 6 5 / \ /...