卷別

資料結構

選擇

國立中央大學 2026 · 考試 · 第 20 題

Which of the following comparisons between BST and Heap is incorrect?

(A)
In-order traversal of a BST is ordered, while that of a Heap is not.
(B)
The time complexity of searching for any value in the Heap is $O(\log n)$ .
(C)
A heap is a complete binary tree, while a BST is not.
(D)
Heaps are typically implemented using arrays, while BSTs are typically implemented using pointers.

標準解析

AI 生成