G is a tree, then G's spanning tree has ( ) tree.
A: 1
B: 0
C: 2
D: I'm not sure
A: 1
B: 0
C: 2
D: I'm not sure
举一反三
- Who’s in the tree A: The tree’s falling down. B: The boy’s falling out of the tree. C: The woman’s shouting.
- Is this __________ apple tree? No, it is __________ orange tree.
- The cherries on this tree are bigger than ______ on that tree.
- —Is this ＿＿apple tree?—，it is ＿＿orange tree. A: an/the B: the/the C: an/an D: the/an
- 将一棵有n个结点的完全二叉树用宽度优先搜索的方式存储在一个数组tree[]中，则根据完全二叉树的特性，下列选项中不正确的是：（）。 A: 若2*i<=n，那么tree[i]的左孩子为tree[2*i]；若2*i+1<=n，那么tree[i]的右孩子为tree[2*i-1] B: 若i>1，tree[i]的父亲为tree[idiv2] C: 若i>ndiv2，那么tree[i]为叶子结点 D: 若i<（n-1）div2.那么tree[i]必有两个孩子