题目内容

For any non-empty binary tree T, if the number of leaf nodes is 5， the number of nodes with degree 1 is 6，then the number of nodes of degree 2 is ( )

A. 4
B. 5
C. 6
D. 7

查看答案

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

更多问题

The depth of a complete binary tree with 2000 nodes is ().

A. 9
B. 10
C. 11
D. 12

How many edges does the minimum spanning tree of a connected graph G with n vertices have?

A. n-1
B. n
C. n+1
D. Uncertain

If there are 20,000 elements in S, if only the 10 smallest elements are required, then which is the most efficient method.

A. shell sort
B. heap sort
C. bubble sort
D. radix sort

When a tree is transformed into a binary tree, the right subtree of root node in binary tree is always empty.