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 wit ...
/dl/406525.html
标签：
tree
conditions
completely
satisfying
上传时间：
2014-01-01
上传用户：gundan
