[Leetcode] [JavaScript] Binary Tree postorder Traversal

Binary Tree postorder Traversal

Given a binary tree, return the postorder traversal of its nodes ' values.

For example:
Given binary Tree {1,#,2,3} ,

   1         2    /   3

Return [3,2,1] .

Note:recursive solution is trivial, could do it iteratively?

The same recipe, the same flavor.

Binary Tree inorder Traversal:

Http://www.cnblogs.com/Liok3187/p/4808974.html

Binary Tree Preorder Traversal:

Http://www.cnblogs.com/Liok3187/p/4805834.html

1 /**2 * Definition for a binary tree node.3 * Function TreeNode (val) {4 * This.val = val;5 * This.left = This.right = null;6  * }7  */8 /**9 * @param {TreeNode} rootTen * @return {number[]} One  */ A varPostordertraversal =function(root) { -     varstack = [], res =[], top; -     if(root) { the Stack.push (root); -     } -  -      while(stack.length!== 0){ +top =Stack.pop (); -         if(typeoftop = = = "Number"){ + Res.push (top); A}Else{ at Stack.push (top.val); -             if(top.right) { - Stack.push (top.right); -             } -             if(top.left) { - Stack.push (top.left); in             } -         } to     } +     returnRes; -};

[Leetcode] [JavaScript] Binary Tree postorder Traversal