One of the operations on a BST is the need to insert data as nodes. Whereas in our first implementation, we had to insert the nodes ourselves, here we are going to let the tree be in charge of storing its data.
In order to make a search possible, the nodes must be stored in a specific way. For each given node, its left child node will hold data that is less than its own value, as already discussed. That node's right child node will hold data greater than that of its parent node.
We are going to create a new BST of integers by starting with the data 5. To do this, we will create a node with its data attribute set to 5.
Now, to add the second node with value 3, 3 is compared with 5, the root node:
Since 5 is greater than 3, ...
