17. Let T be a binary search tree with left and right pointers as usual.What does the function M(T) compute? 5ccbe1b60f576.jpg
(A) The height of T.
(B) 1 + the height of T.
(C) The number of keys in T.
(D) The number of nodes in the extended version of T.

答案：登入後查看
統計： A(10), B(14), C(19), D(55), E(0) #1989184