nextwe connect the nodes to each other we let be the root node with and as its children finallywe hook as the left child to so that we get few iterations when we traverse the left sub-treen left_child right_child left_child once we have our tree structure set upwe are ready to traverse it as mentioned previouslywe shall traverse the left sub-tree we print out the node and move down the tree to the next left node we keep doing this until we have reached the end of the left subtreecurrent while currentprint(current datacurrent current left_child as you will probably have noticedthis requires quite bit of work in the client codeas you have to manually build up the tree structure binary trees binary tree is one in which each node has maximum of two children binary trees are very common and we shall use them to build up bst implementation in python the following figure is an example of binary tree with being the root nodeeach child is identified as being the right or left child of its parent since the parent node is also node by itselfeach node will hold reference to right and left node even if the nodes do not exist regular binary tree has no rules as to how elements are arranged in the tree it only satisfies the condition that each node should have maximum of two children