WH LogoWH·CSBank
資料結構›Ch9 進階樹
第 48 題／共 88 題
◀ DS 48/88
48. Red-Black Tree、Insertion
#DS-09-048中Red-Black TreeInsertion
  1. A red-black tree is initially empty. Now four keys are inserted in the order of 5, 2, 7, 3, 4. Which of the following statement(s) is(are) true about the resulting red-black tree?
📄 交大111
跳轉到第題
← 上一題下一題 →
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 41–60 / 88
4142434445464748495051525354555657585960