二叉树遍历

二叉树结构体

/**
 * 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<Integer>();
        preorder(root, result);
        return result;
    }

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

中序遍历

// 中序遍历·递归·LC94_二叉树的中序遍历
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        inorder(root, res);
        return res;
    }

    void inorder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        inorder(root.left, list);
        list.add(root.val);             // 注意这一句
        inorder(root.right, list);
    }
}

后序遍历

// 后序遍历·递归·LC145_二叉树的后序遍历
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);             // 注意这一句
    }
}

非递归遍历

前序遍历

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        Stack<TreeNode> stack = new Stack<>();
        //根节点入栈
        stack.push(root);
        while(!stack.isEmpty()){
            //出栈
            TreeNode node = stack.pop();
            res.add(node.val);
            //由于栈的先进后出的存储规则，所以前序遍历应该应该右孩子先入栈
            if(node.right != null) stack.push(node.right);
            if(node.left != null) stack.push(node.left);
        }
        return res;
    }
}

后序遍历

前序遍历：NLR

后序遍历：LRN

NLR --> NRL --reverse–> LRN

后序遍历代码和前序遍历代码相差就三行

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        Stack<TreeNode> stack = new Stack<>();
        //根节点入栈
        stack.push(root);
        while(!stack.isEmpty()){
            //出栈
            TreeNode node = stack.pop();
            res.add(node.val);
            //由于栈的先进后出的存储规则，所以后序遍历应该应该左孩子先入栈：         
            if(node.left != null) stack.push(node.left);//变化一  
            if(node.right != null) stack.push(node.right);//变化二
        }
        Collections.reverse(res);//翻转list
        return res;
    }
}

中序遍历

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        Stack<TreeNode> stack = new Stack<>();
        //创建指针遍历二叉树
        TreeNode cur = root;
        while(cur != null || !stack.isEmpty()){
            //一路向左
            if(cur != null){
                stack.push(cur);
                cur = cur.left;
            }else{
                //访问右子树
                cur = stack.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }
}

层序遍历

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        //注意判断二叉树是否非空
        if (root == null) return res;
        Deque<TreeNode> queue = new ArrayDeque<>();
        //根节点入队
        queue.offerLast(root);
        while(!queue.isEmpty()){
            //存储每一层的元素
            List<Integer> list = new ArrayList<>();
            //存储每一层元素的个数
            int size = queue.size();
            //遍历该层元素
            while(size > 0){
                //弹出元素
                TreeNode node = queue.pollFirst();
                list.add(node.val);
                if(node.left != null) queue.offerLast(node.left);
                if(node.right != null) queue.offerLast(node.right);
                //注意每层大小要减少
                size--;
            }
            //将该层元素存入结果集
            res.add(list);
        }
        return res;
    }
}