Tree: Postorder Traversal

  • + 0 comments

    Python

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