資料結構›Ch9 進階樹第 19 題／共 88 題
19. Red-Black Tree、樹高
#DS-09-019中Red-Black Tree樹高
題組題幹（本題：第15題，共 2 小題）點擊展開
Consider a red-black tree with internal nodes, where is even.
In the red-black tree with 26 nodes that reaches the solution of the problem above, what is the maximum height of the tree? A tree with one node is assumed to have height 1.
📄 台大111
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹