資料結構›Ch9 進階樹
第 5 題/共 88 題
◀ DS 5/88
5. 2-3 Tree、BST、樹的轉換
#DS-09-005中2-3 TreeBST樹的轉換

a. Given the 2-3 tree below, represent it as a binary search tree (BST). In your drawing, please highlight the edges that are within a 3-node.

b. Please remove the root of your BST in the question 4a, and replace it with something from the left subtree. Please draw the BST with the new root and highlight the edges that are within a 3-node.

題目附圖
📄 台大113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 1–20 / 88