資料結構›Ch9 進階樹
第 85 題/共 88 題
◀ DS 85/88
85. Leftist Tree、Weight-Biased Leftist Tree
#DS-09-085易Leftist TreeWeight-Biased Leftist Tree

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

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