Tree: Inorder Traversal

  • + 0 comments

    PYTHON3 Solution:

    def inOrder(root):
        #Write your code here
         if root == None:
             return
         inOrder(root.left)
         print(root.info, end=" ")
         inOrder(root.right)