单项选择题
A.存储地址 B.元素的序号 C.元素个数 D.关键码值
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)