6.1-3 Show that in any subtree of a max-heap, the root of the subtree contains the largest value occurring anywhere in that subtree. Since for max-heap the parent is always greater than or equal to the child. The child is also greater than equal its childs. This relation continues till we reach end of the tree.
No comments:
Post a Comment