18年冬季第四题 PAT甲级 1155 Heap Paths (30分)

汇总贴

2020年3月PAT甲级满分必备刷题技巧

题目

题目来源：https://pintia.cn/problem-sets/994805342720868352/problems/1071785408849047552

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))

One thing for sure is that all the keys along any path from the root to a leaf in a max/