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
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
举一反三
- 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.
- A Node structure in a linked list . A: consists of two parts, one for the node value and the other for a pointer to another node. B: has only one part to store the node value. C: has only one part to store the relationship pointer between the nodes. D: consists of two parts, one for the node value and the other for the number of bytes required by the node.
- 中国大学MOOC: By is meant the property of having two levels of structures, such that units of the primary level are composed of elements of the secondary level and each of the two levels has its own principles of organization.
- 中国大学MOOC: Byis meant the property of having two levels of structures, such that units of the primary level are composed of elements of the secondary level and each of the two levels has its own principles of organization.
- An academic collaboration network is one type of social network. In such a network, a node with degree two means that: A: A scholar has coauthored a paper with one other scholar. B: A scholar has coauthored publications with two other scholars. C: A scholar has authored two publications. D: A publication was coauthored by two scholars.