資料結構›Ch5 樹狀結構第 33 題／共 48 題
33. Binary Search Tree、Rotation、Tree Height
#DS-05-033中Binary Search TreeRotationTree Height
- Assume we are going to do a tree rotation (could be a left-rotate or a right-rotate) on the root node for each of the following binary search tree. Which of the binary search trees might become taller (the height of tree gets increased) after the rotation?
📄 交大111
▤完整推導請見《WH 資工筆記 · 資料結構》Ch5 樹狀結構