卷別

資料結構與演算法

選擇

國立臺灣大學 2026 · 考試 · 第 17 題

(4 points) Consider the Binary Search Tree in Figure 1. If node 66 is removed (replacing it with its in-order successor), what is the resulting preorder traversal sequence?

Figure 1 的二元搜尋樹結構如下：

        56
       /  \
     23    66
    /     /  \
   3     57   72

(A)
3, 23, 56, 57, 72.
(B)
56, 23, 3, 72, 57.
(C)
3, 23, 57, 72, 56.
(D)
56, 23, 57, 72, 3.
(E)
None of the other choices.

標準解析

AI 已複查