举一反三
- A heap must be a complete binary tree
- Heap is not necessarily a complete binary tree
- Heap is not necessarily a complete binary tree A: 正确 B: 错误
- A full binary tree is a tree where________________.( ) A: each node has exactly one or two children. B: all the leaves are at the same level. C: each node has exactly two children D: each node has exactly zero or two children.
- Given a tree, you can find the only binary tree corresponding to it A: 正确 B: 错误
内容
- 0
The meaning of the left heap relative to a full binary heap is:相对于完全二叉堆，左式堆存在的意义是： A: More efficient insertion高效的插入 B: More efficient deletion高效的删除 C: More efficient mergence高效的合并 D: To defeat the counter-revolutionary rightists打倒反革命右派
- 1
For a computer to understand an instruction(指令), it must be represented in binary(二进制).
- 2
A valid phylogenetic tree must be rooted with an outgroup.
- 3
A complete binary tree is a tree where________________.( ) A: each node has exactly one or two children B: each node has exactly zero or two children C: each node has exactly two children D: every level of the tree is completely filled except the last level
- 4
The method for inserting elements in a full binary heap is在完全二叉堆中插入元素的方法是 A: Insert into the bottom, percolateUp插入到底层，上滤 B: Insert into the root, percolateDown插入到根节点，下滤 C: Insert into the bottom directly直接插入到底层 D: Insert into the root directly直接插入到根节点