A heap must be a complete binary tree
举一反三
- Heap is not necessarily a complete binary tree
- A heap must be a full binary tree
- Heap is not necessarily a complete binary tree A: 正确 B: 错误
- 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
- Given a tree, you can find the only binary tree corresponding to it A: 正确 B: 错误