Tree: Postorder Traversal

  • + 0 comments

    Very Simple Recursive JavaScript Solution:

    const resp = []

    function helperFunc(root) { if(!root) return; resp.push(root.data) helperFunc(root.right); helperFunc(root.left); }

    function postOrder(root) { helperFunc(root); console.log(resp.reverse().join(' ')); }