卷別

資料結構

選擇

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

Regarding the comparison between Red-Black Trees and AVL Trees, which of the following statements is correct?

(A)
AVL trees have more lenient balance conditions than red-black trees, so they can be taller.
(B)
Red-black trees guarantee that the longest path from the root to a leaf is no more than twice the length of the shortest path.
(C)
In scenarios with a large number of lookups, red-black trees are faster than AVL trees.
(D)
In scenarios involving numerous insertions and deletions, AVL trees outperform red-black trees.

標準解析

AI 生成