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

浒鱼鱼

于 2020-02-22 21:36:44 发布

阅读量995

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级文章标签：数据结构算法树堆 c++ 二叉树

本文链接：https://blog.csdn.net/allisonshing/article/details/104448296

该博客主要讨论计算机科学中的堆数据结构，并提供了一个PAT甲级编程题目的解析和解决方案。题目要求根据给定的层序遍历序列判断完全二叉树是否为最大堆、最小堆或非堆。博主提供了利用深度优先搜索（DFS）方法检查路径的思路，并指出在打印路径时需遵循右子树在前、左子树在后的规则。此外，还提到了其他可能的DFS实现方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

汇总贴

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/