卷別

資料結構

選擇

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

Suppose that we have a Binary Search Tree (BST) consisting of nodes, where each node stores a unique integer between 1 and 1000. Which of the following sequences could be a VALID sequence of nodes examined when searching for the number 101?

(A)
80, 252, 90, 130, 110, 100, 120, 101
(B)
252, 130, 120, 110, 100, 90, 80, 101
(C)
80, 90, 252, 110, 130, 120, 100, 101
(D)
80, 252, 90, 100, 130, 120, 110, 101
(E)
252, 130, 110, 80, 90, 100, 120, 101

標準解析

AI 生成