資料結構›Ch9 進階樹
第 36 題/共 88 題
◀ DS 36/88
36. Red-Black Tree、Validity、Depth Ratio
#DS-09-036中Red-Black TreeValidityDepth Ratio

二、簡答題(共25分):請務必依序、並依題意簡要作答。

  1. [8%] Three students tried to build red-black trees from the following numbers: 10, 20, 30, 15, 25, 35, 45, 12, 22, 32. They ended up with three different trees (for clarity, the external nodes are not shown):
題目附圖
📄 交大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 21–40 / 88