144.145.二叉树的前序后序遍历（递归）

https://leetcode-cn.com/problems/binary-tree-preorder-traversal/

解题思路

前序遍历：
先遍历根节点
再遍历左子树（递归）
再遍历右子树（递归）

递归函数的三个要点：

• 确定递归函数的参数和返回值
• 确定终止条件
• 确定单层递归的逻辑

代码

/**
 * 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> preorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        getPreorder(root,result);   //传参：传的是地址
        return result;
    }
    
    //确定递归函数的参数和返回值
    private void getPreorder(TreeNode node,List<Integer> list){

        //终止条件
        if(node == null)
            return;

        //前序遍历，确定单层递归的逻辑
            list.add(node.val);     //遍历根
            getPreorder(node.left,list);    //遍历左子树
            getPreorder(node.right,list);   //遍历右子树
    
    }
}

https://leetcode-cn.com/problems/binary-tree-postorder-traversal/

解题思路

后序遍历顺序：
1.有左子树先遍历左子树
2.有右子树先遍历右子树
3.遍历根节点

代码

/**
 * 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> result = new ArrayList<>();
        postOrder(root,result);
        return result;
    }   

    //递归函数：确定返回类型以及参数类型
    private void postOrder(TreeNode root,List<Integer> list){
        //确定递归停止条件
        if(root == null)
            return;
        //递归
        postOrder(root.left,list);
        postOrder(root.right,list);
        list.add(root.val);
    }

}