Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned a priority (a number) such that the priority of each internal node is less than the priority of its parent. As a consequence, the root has the greatest priority in the tree, which is one of the reasons why heaps can be used for the implementation of priority queues and for sorting.
Read the statement of problem G for the def
阅读背景：
笛卡尔树（poj1785 Binary Search Heap Construction）(笛卡尔树）（线段树）
来源：互联网
分享到：
