这篇博客介绍了如何判断一个完全二叉树是否为堆，包括最大堆和最小堆，并提供了相关知识点和解题思路。内容涉及堆的定义、层序遍历和后序遍历，以及如何通过深度优先搜索实现后序遍历序列的生成。同时，博主分享了PAT甲级考试中关于堆的题型特点和备考建议。
汇总贴
题目
来源：https://pintia.cn/problem-sets/994805342720868352/problems/994805342821531648
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))
Your job is to tell if a given complete binary tree is a heap.
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
