HeapĀ is an almost complete Binary Tree implemented in a sequential format such that the value at any of the nodes (nd) is >= or <=...