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

Sort by

recency

|

227 Discussions

|

  • sashinidawpadi
     + 0 comments
    public static void postOrder(Node root) {
        if(root != null){
            postOrder(root.left);
            postOrder(root.right);
            System.out.print(root.data+" ");
        }
    }

  • namnika_janband1
     + 0 comments

    Javascript:

    function postOrder(root) {
	  let result = []
		let values = ""
    
    function dfsPostTraverse(currentNode){
        if(currentNode == null){
            return;
        }
        dfsPostTraverse(currentNode.left)
        dfsPostTraverse(currentNode.right)
        result.push(currentNode.data)
    }
    
    dfsPostTraverse(root)
    
    for(let i=0; i<result.length; i++){
        values += result[i] + " "
    }
    console.log(values)
}

  • pvolpe
     + 0 comments
    def postOrder(root):
    result = []
    
    def traverse(node):
        if not node:
            return
        traverse(node.left)
        traverse(node.right)
        result.append(str(node.info))
        
    traverse(root)
    print(" ".join(result))

  • Avula_Sathvik
     + 0 comments

    solution for java

    public static void postOrder(Node root) {

        if(root==null) return;

    postOrder(root.left);

    postOrder(root.right);
    System.out.print(root.data+" ");
}

  • samuelpetroline
     + 0 comments

    Solution with Javascript:

    function postOrder(root) { const stack = iterate(root)

    console.log(stack.join(' ')) }

    function iterate(root, stack = []) { if (root == null) { return }

    iterate(root.left, stack) iterate(root.right, stack)

    stack.push(root.data)

    return stack } `