since is greater than it will be put in the left sub-tree of node our bst will look as followsthe tree satisfies the bst rulewhere all the nodes in the left sub-tree are less than its parent to add another node of value to the treewe start from the root node with value and do comparisonsince is greater than the node with value is situated to the right of this root what happens when we want to add node that is equal to an existing nodewe will simply add it as left node and maintain this rule throughout the structure if node already has child in the place where the new node goesthen we have to move down the tree and attach it let' add another node with value starting from the root of the treewe do comparison between and the comparison reveals that is less than so we move our attention to the left node of which is the node with value