题目内容

单选题 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

单选题 In a binary tree, each node has () two subtrees.

A. more than
B. less than
C. at most
D. at least

单选题 In a preorder traversal, the () is processed first.

A. left subtree
B. right subtree
C. root
D. a or b

答案查题题库