后序遍历
递归方法:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> rev = new ArrayList<Integer>();
postorder(root,rev);
return rev;
}
public void postorder(TreeNode root,List<Integer> list)
{
if(root!=null)
{
postorder(root.left,list);
postorder(root.right,list);
list.add(root.val);
}
}
}
非递归方法:
(待续)
任务:总结先序,中序,后序的非递归方法