树-后续遍历的递归实现

import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;

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 Solution1 {
    public List<Integer> postorderTraversal(TreeNode root){
        List<Integer> res = new ArrayList<>();
        if(root == null)return res;
        postorder(root,res);
        return res;
    }

    // 递归的逻辑一定要到最底层去理解验证一下，因为这涉及到终止的程序和实现步骤
    public static void postorder(TreeNode root, List<Integer> res){
        if(root == null)return;
        postorder(root.left,res);
        postorder(root.right,res);
        res.add(root.val);
    }
}


class test{
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);
        TreeNode node7 = new TreeNode(7);
        node1.left = node2;node1.right = node3;
        node2.left = node4;node2.right = node5;
        node3.left = node6;node3.right = node7;
        List<Integer> res = new ArrayList<>();
        res = new Solution2().postorderTraversal(node1);
        for (int i = 0; i < res.size(); i++) {
            System.out.println(res.get(i));
        }
    }
}