資料結構›Ch9 進階樹
第 64 題/共 88 題
◀ DS 64/88
64. AVL Tree、Red-Black Tree、樹高上界
#DS-09-064中AVL TreeRed-Black Tree樹高上界

[4%] For the number of nodes n=15n = 15, what is the maximum possible height of an AVL tree, and what is the maximum possible height of a red-black tree? Note that the root is at level 1.

Answer format: AVL max possible height=?, Red-black tree max possible height=?

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