A sorting method which uses the binary tree concept such that label of any node is larger than all the labels in the sub trees, is called
A Sorting method which uses the binary tree concept like label of any node is larger than all the, labels in the sub trees, is known as Heap sort because heap sort works on a full binary tree with the property that the value at any node 'N' of the tree should be greater than or equal to the value at all its children nodes.