leetcode 二叉树的遍历（一） 算法记录

二叉树遍历的相关题目

leetcode 144前序遍历 145后序遍历 94中序遍历

使用语言：Java

使用方式：递归遍历

二叉树遍历

1. 深度优先遍历 => 前序遍历（中左右）、后序遍历（左右中）、中序遍历（左中右）
2. 广度优先遍历 => 层次遍历

144. 前序遍历

/**
 * 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，用于存放结果
        List<Integer> list = new ArrayList();
        //调用前序遍历
        preorder(root,list);
        //返回结果
        return list;
    }

    //定义前序遍历
    public void preorder(TreeNode root,List<Integer> list) {
        //终止条件
        if (root == null) {
            return;
        }

        //一次遍历中要完成
        list.add(root.val);
        preorder(root.left,list);
        preorder(root.right,list);
    }
}

145. 后序遍历

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

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

94. 中序遍历

/**
 * 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> inorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        inorder(root,list);
        return list;
    }

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