A heap is a binary TREE satisfying the following
conditions:
This TREE is completely balanced.
If the height of this binary TREE is h, then leaves
can be at level h or level h-1.
All leaves at level h are as far to the left as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.
標(biāo)簽：
TREE
conditions
completely
satisfying
上傳時間：
2014-01-01
上傳用戶：gundan
