LeetCode-145.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 you do it iteratively?

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }

 */

递归

public class Solution 
{
    public IList<int> PostorderTraversal(TreeNode root) 
    {
        IList<int> list = new List<int>();
        Fun(list, root);
        return list;
    }
    
    private void Fun(IList<int> list, TreeNode root)
    {
        if (root == null)
            return;
        Fun(list, root.left);
        Fun(list, root.right);
        list.Add(root.val);
    }
}

非递归

public IList<int> PostorderTraversal(TreeNode root) 
    {
        IList<int> list = new List<int>();
        if (root == null)
            return list;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        stack.Push(root);
        while (stack.Count>0)
        {
            root = stack.Pop();
            list.Insert(0, root.val);
            if (root.left != null)
                stack.Push(root.left);
            if (root.right != null)
                stack.Push(root.right);
        }
        return list;
    }