ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 18 題
考科資料結構
(3 points) After inserting a new node into a Red-Black Tree, which of the following operations might be performed to restore Red-Black properties?
- (A)Rotations and recoloring of nodes
- (B)Complete tree re-balancing from scratch
- (C)Splitting and merging nodes, similar to B-Trees
- (D)Directly moving the newly inserted node to the root