trees fig the tree after inserting fig the tree after inserting to insert the it must go to the right of all nodes inserted so far since it is greater than all nodes in the tree this is depicted in fig the goes to the right of the and to the left of the in fig the only place the can go is to the right of the left of the and right of the in fig the final tree is pictured in fig this is binary search tree since all nodes with subtrees have values less than the node in the left subtree and values greater than or equal to the node in the right subtree while both subtrees also conform to the binary search tree property the final part of the program in sect iterates over the tree in the main function this calls the __iter__ method of the binarysearchtree class this __iter__ method returns an iterator over the root' __node object the __node' __iter__ method is interesting because it is recursive traversal of the tree when for elem in self left is writtenthis calls the __iter__ method on the left subtree after all the elements in the left subtree are yieldedthe value at the root of the tree is yieldedthis copy belongs to 'acha