資料結構›Ch9 進階樹
第 87 題/共 88 題
◀ DS 87/88
87. Leftist Tree、Height-Biased Leftist Tree
#DS-09-087易Leftist TreeHeight-Biased Leftist Tree

Consider a height-biased leftist tree (HBLT). Let w(x)w(x) be the number of internal nodes in the subtree with root x. Which of the following statements are false?

📄 中央111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 81–88 / 88