Problem 3831 · Medium
Collect one depth of a search tree with a level-order walk, sort those values, and take the upper middle.
Open the interactive visualisation