单选题：If a binary search tree of $$N$$ nodes is complete, which one of
If a binary search tree of $$N$$ nodes is complete, which one of the following statements is FALSE?
A.the average search time for all nodes is $$O(\log N)$$
B.the minimum key must be at a leaf node
C.the maximum key must be at a leaf node
D.the median node must either be the root or in the left subtree
答案：C
A.the average search time for all nodes is $$O(\log N)$$
B.the minimum key must be at a leaf node
C.the maximum key must be at a leaf node
D.the median node must either be the root or in the left subtree
答案：C
