【PAT (Advanced Level) Practice】1147 Heaps (30 分)

最新推荐文章于 2024-01-13 21:53:28 发布

理想不闪火

最新推荐文章于 2024-01-13 21:53:28 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_43838785/article/details/118567655

算法专栏收录该内容

334 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了计算机科学中堆的概念，包括最大堆和最小堆的性质，并提供了一个测试案例，要求判断给定的完全二叉树是否为堆并输出其后序遍历序列。

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

1147 Heaps (30 分)
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.

Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 100), the number of trees to be tested; and N (1 < N ≤ 1,000), the number of keys in each tree, respectively. Then M

了解本专栏