資料結構›Ch9 進階樹
第 38 題/共 88 題
◀ DS 38/88
38. Red-Black Tree
#DS-09-038中Red-Black Tree

(3%) The following question is about a red-black tree with M nodes, where M >= 3. Node definition is used. For the M nodes, the external and internal nodes are included. The function ceil(x) returns the smallest possible integer value which is greater than or equal to the given argument x. Which of the following statement(s) is(are) true?

📄 交大112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 21–40 / 88