A heap must be a full binary tree
举一反三
- 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: 错误