Problem 701 · Medium

Insert into a Binary Search Tree

Add a new value to a search tree as a leaf without breaking ordering. The visual descends from the root and attaches the value where an empty slot appears.

Open the interactive visualisation