kk's Blog
04
07
PAT - [1147] Heaps (30分) PAT - [1147] Heaps (30分)
从后往前检查所有节点(除了根节点)和它的父节点的关系,判断是否破坏最大堆或者最小堆的性质 题目In computer science, a heap is a specialized tree-based data structure th
2020-04-07