力扣145.二叉树的后序遍历

145.二叉树的后序遍历

思路1(递归):

对二叉树进行 左节点，右节点，根节点 进行遍历

代码实现

/**
 * 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 LinkedList<>();
        postorderTraversal(root, list);
        return list;
    }

    public void postorderTraversal(TreeNode root, List<Integer> list) {
        if (root == null) return;

        postorderTraversal(root.left, list);
        postorderTraversal(root.right, list);
        list.add(root.val);
    }
}

思路2(递归):

可以采取前序遍历(迭代)方式，进行逆序输出

1. 先把 根节点 入栈，根据后序遍历原则，最初的根节点是最后一个遍历的，所以可以采用 链表的 addFirst() 方法放入链表中
2. 根据栈的先出后进，可以 先放入根节点的左节点，再放入根节点的右节点
3. 将右节点出栈，并重复 2，1 的操作，最后得出后序遍历

代码实现

/**
 * 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) {
        LinkedList<Integer> list = new LinkedList<>();
        Stack<TreeNode> stack = new Stack<>();
        
        if (root == null) {
            return list;
        }
        stack.push(root);
        while (!stack.isEmpty()) {
            
            TreeNode node = stack.pop();
            list.addFirst(node.val);

            if (node.left != null) {
                stack.push(node.left);
            }
            if (node.right != null) {
                stack.push(node.right);
            }
        }
        return list;
    }
}