BST Operation: Insert (How it works)

The insert operation in a BST implementation of OrderedSet ADT must (partially) traverse the tree to find where to insert the new element so the BST remains valid.

Exercise Insert $6$ to the following BST.

Solution