30. Consider a binary heap that results from successively inserting keys 6, 3, 7, 8, 5, 1, 2, 4, 9 into an initially empty heap. Then the depth of key 5 is
(A)0
(B)1
(C) 2
(D) 3
(E) None of above

答案:登入後查看
統計: 尚無統計資料

詳解 (共 1 筆)

#7105804
1. 題目解析 這道題目要求我們確定在一...
(共 892 字,隱藏中)
前往觀看
0
0