We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Postorder Traversal
  5. Discussions

Tree: Postorder Traversal

  • bindra_sheetal05
     + 0 comments

    Tree: Postorder Traversal | PYTHON 3 Solution:

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