堆
TheWise_lzy
已毕业,社畜一枚
展开
-
1147 Heaps (30 分) 堆的判断
1147Heaps(30分) In computer science, aheapis 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 ...原创 2019-08-19 20:38:47 · 248 阅读 · 0 评论 -
1155 Heap Paths (30 分) 判断大小顶堆
1155Heap Paths(30分) In computer science, aheapis 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 gre...原创 2019-03-20 20:56:07 · 319 阅读 · 0 评论 -
L2-012 关于堆的判断
L2-012关于堆的判断(25 分) 将一系列给定数字顺序插入一个初始为空的小顶堆H[]。随后判断一系列相关命题是否为真。命题分下列几种: x is the root:x是根结点; x and y are siblings:x和y是兄弟结点; x is the parent of y:x是y的父结点; x is a child of y:x是y的一个子结点。 输入格式: 每组测试第...原创 2019-03-03 20:30:37 · 168 阅读 · 0 评论