Java 递归实现二叉树的前序、中序、后序遍历

0. 二叉树节点定义

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;
	}
}

1. 二叉树的前序遍历

口诀：根 左 右

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
		preOrder(root, res);
		return res;
    }

    private void preOrder(TreeNode root, List<Integer> list) {
		if (root == null) {
			return;
		}
		list.add(root.val);
		preOrder(root.left, list);
		preOrder(root.right, list);
	}
}

2. 二叉树的中序遍历

口诀：左 根 右

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        midOrder(root, res);
        return res;
    }
    private void inOrder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        inOrder(root.left, list);
        list.add(root.val);
        inOrder(root.right, list);
    }
}

3. 二叉树的后序遍历

口诀：左 右 根

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        postorder(root, res);
        return res;
    }

    void postorder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        postorder(root.left, list);
        postorder(root.right, list);
        list.add(root.val);            
    }
}

⭐核心：注意何时遍历根节点，特别注意三种遍历方法的list.add(root.val);