問題詳情

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
書單:沒有書單,新增