单项选择题
二叉树__(1)__。在完全二叉树中,若一个结点没有__(2)__,则它必定是叶结点。每棵树都能唯一地转换成与它对应的二叉树。由树转换成的二叉树里,一个结点N的左子树是N在原树里对应结点的__(3)__,而N的右子树是它在原树里对应结点的__(4)__。二叉排序树的平均检索长度为__(5)__。
A.O(n2) B.O(n) C.O(log2n) D.O(nlog2n)
A.最左子树 B.最右子树 C.最邻近的右兄弟 D.最邻近的左兄弟
A.左子树 B.右子树 C.左子树或没有右子树 D.兄弟
A.是特殊的树 B.不是树的特殊形式 C.是两棵树的总称 D.是只有两个根结点的树状结构
A.(B,F,G,J,A,E,D,I,C,H) B.(B,A,D,E,F,G,I,J,H,C. C.(A,B,D,C,E,F,I,J,G,H) D.(A,B,D,C,F,E,J,I,H,G)
A.(C,B,D,A,F,E,I,J,G,H) B.(C,B,D,A,E,F,I,G,J,H) C.(B,A,D,E,F,G,I,J,H,C. D.(B,C,D,A,E,F,I,J,G,H)
A.(A,B,D,C,F,E,I,J,H,G) B.(A,B,D,C,E,F,I,H,G,J) C.(B,F,G,E,A,I,D,C,H,J) D.(B,F,G,J,A,E,D,I,C,H)
A.(B,F,G,J,A,D,I,E,H,C. B.(B,F,G,J,A,E,D,I,C,H) C.(A,B,D,C,E,F,I,J,G,H) D.(C,B,D,A,E,F,I,G,J,H)
A.(181,132,314,205,541,518,946,827,746,984) B.(541,132,827,746,518,181,946,314,205,984) C.(205,132,314,181,518,746,946,984,541,827) D.(541,132,984,746,827,181,946,314,205,518)
A.(181,132,314,205,541,518,946,827,746,984)和(541,132,827,746,518,181,946,314,205,984) B.(132,541,746,518,181,946,314,205,827,984)和(541,132,827,746,518,181,946,314,205,984) C.(205,132,314,181,518,746,946,984,541,827)和(132,541,746,518,181,946,314,205,827,984) D.(541,132,984,746,827,181,946,314,205,518)和(132,541,746,518,181,946,314,205,827,984)