問題詳情
41. Which of the following statements are true?
(A) A heap is always a complete binary tree.
(B) Doubly linked list is suitable for random access.
(C) A sparse matrix has many zero elements.
(D) Given a max heap with n nodes. A Push operation takes O(logn) time, and aPop operation takes O(1) time.
(E). A binary tree's postorder and inorder traversal sequences are different.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增