问题描述:
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?
问题分析:
题目要求中跟遍历二叉树,首先想到的就是简单明了的递归遍历,直接代码不解释:
public ArrayList<Integer> postorderTraversal(TreeNode root) {
ArrayList<Integer> array=new ArrayList<Integer>();
if(root==null)
return array;
ArrayList<Integer> left=postorderTraversal(root.left);
ArrayList<Integer> right=postorderTraversal(root.right);
array.addAll(left);
array.addAll(right);
array.add(root.val);
return array;
}
然而题目要求用迭代法,这就加深点难度了。我们可以采用先跟遍历的思想,将根节点压入栈,循环弹出栈遍历,将节点值加入已遍历序列的最前面(这样在其之前遍历的节点就变成在其后了),而后将其左子树和右子树压入栈。
public ArrayList<Integer> postorderTraversal(TreeNode root){
ArrayList<Integer> list=new ArrayList<Integer> ();
if(root==null)return list;
Stack<TreeNode>stack =new Stack<TreeNode>();
stack.add(root);
while(!stack.isEmpty()){
TreeNode node=stack.pop();
list.add(0, node.val);
if(node.left!=null){
stack.add(node.left);
}
if(node.right!=null){
stack.add(node.right);
}
}
return list;
}