PAT 1147. Heaps (30) - 甲级

原创

已于 2023-11-09 15:50:59 修改 · 2.2k 阅读

6 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #图论 #数据结构

于 2018-04-03 22:56:31 首次发布

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 <= 1000), the number of keys in each tree, respectively. Then M lines follow, each c