資料結構›Ch9 進階樹第 35 題／共 88 題
35. Red-Black Tree、Black Height
#DS-09-035中Red-Black TreeBlack Height
- (6%) A Red-Black Tree is a self-balancing binary search tree that maintains specific balance properties. For a given black height , derive the minimum and maximum number of nodes and that a Red-Black Tree can have. Clearly explain the reasoning and provide the final formulas for and in terms of .
📄 交大114
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹