摘要： 6.1 - 1:Define n to be the number of elements in a heap of height h, then:6.1-2:6.1-3:For any of the sub-tree of one max-heap, it maintains the basic heap property, i.e., A[parent(i)] >= A[i]. and the root of one sub-tree is the ancestor of all its nodes, therefore, the root is the largest by rec 阅读全文