题目内容

单选题 The indegree of () of a tree is always zero.

A. any node
B. a branch
C. the root
D. a leaf

查看答案

搜索结果不匹配？点我反馈

更多问题

单选题 If an internal node has 4 outdegree branches, its degree is ().

A. 9
B. 1
C. 4
D. 5

单选题 A node of a tree has a degree of 3. This means its outdegree is ().

A. 0
B. 2
C. 4
D. none of the above

单选题 A () is a sequence of nodes in which each node is adjacent to the next one.

A. leaf
B. root
C. descendant
D. path

单选题 If the height of a tree is 10, the highest level of the tree is ().

A. 10
B. 9
C. 5
D. 1