問題詳情

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.

參考答案

答案:D
難度:適中0.666667
統計:A(0),B(2),C(0),D(6),E(0)

內容推薦

內容推薦