資料結構›Ch9 進階樹第 65 題／共 88 題
65. Predecessor/Successor、Red-Black Tree、AVL Tree、B+ Tree、Hashing
#DS-09-065易Predecessor/SuccessorRed-Black TreeAVL TreeB+ TreeHashing
（複選）[4%] You need operations: insert(x), delete(x), find(x), and also “find predecessor/successor of x”. Please select all that are correct for the predecessor/successor queries.
📄 成大115
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹