Problem 1932 · Hard
Combine several small binary search trees by plugging one tree into a leaf of another.
Open the interactive visualisation