BST Operation: Insert (How it works)
In a BST implementation of OrderedSet ADT, the' insert' operation must (partially) traverse the tree to find where to insert the new element, so the BST remains valid.
![](/img/16/bst09.gif)
Exercise Insert $6$ to the following BST.
![](/img/16/bst02.png)
Solution
![](/img/16/bst10.png)