这题题目的数据，算法与描述和clarification里的内容不符。希望更改数据重测。

• 附原题描述： (0) ahyangyi 2007-04-01 17:26:38
  • A max-heap holds the property that for each node than the root, it’s key is no greater than its parent’s. (0) ahyangyi 2007-04-01 17:26:59
• 再附题解。 (0) ahyangyi 2007-04-01 17:29:33
  • The postorder traversal sequence of keys of a heap described in the text must be a strictly increasing sequence. (0) ahyangyi 2007-04-01 17:29:53