ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 16 題
考科資料結構
(3 points) When inserting a key into a B-Tree node that is already full, which operation occurs first to maintain the B-Tree properties?
- (A)Merge two nodes
- (B)Split the full node into two nodes
- (C)Rotate keys from a sibling node
- (D)Remove keys to reduce the node size