题目:
分析:
后序遍历,即先左节点,后右节点,最后自身结点,前中后序遍历之间相差的也就是顺序不同,代码交换一下位置即可
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list =new ArrayList();
last(root,list);
return list;
}
public void last(TreeNode node,List<Integer> list){
if(node!=null){
if(node.left!=null){
last(node.left,list);
}if(node.right!=null){
last(node.right,list);
}
list.add(node.val);
}
}
}