＜java＞常见二叉树题目（一）

复习总结二叉树常考题目，冲！！！
这次先给出几道非常经典的面试题目。
二叉树的各种遍历

Leetcode题目序号	主要思路解法
144前序遍历	栈
94中序遍历	栈
145后序遍历	栈
102层序遍历	dfs/bfs
107之字形层序遍历	dfs/bfs

144 前序遍历

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
    LinkedList<TreeNode> stack =new LinkedList<>();
    List<Integer> res = new ArrayList<>();
    TreeNode cur = root;
    stack.add(root);
    while(stack.isEmpty()){
    	TreeNode tem = stack.pollLast();
    	res.add(tem.val);
    	if(tem.right!=null){
    		stack.add(tem.right);
    		}
    	if(tem.left!=null){
    		stack.add(tem.left);
    		}
    return res;

94.中序遍历

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        LinkedList<TreeNode> stack = new LinkedList<>();
        List<Integer> res = new ArrayList<>();

        TreeNode cur = root;
        
       while(cur!=null||!stack.isEmpty()){
             while(cur!=null){
                stack.push(cur);
                cur = cur.left;
             }
            cur = stack.pop();
            res.add(cur.val);
            cur = cur.right;
        }
        return res;
    }
}

145.后序遍历

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        LinkedList<TreeNode> stack = new LinkedList<>();
        LinkedList<Integer> output = new LinkedList<>();
        
        if(root ==null)
        return output;
        stack.add(root);

        while(!stack.isEmpty()){
            TreeNode node = stack.pollLast();
            output.addFirst(node.val);
            if(node.right!=null){
                stack.add(node.right);
            }
            if(node.left!=null){
                stack.add(node.left);
            }
        }
        return output;
    }
}

102 层序遍历

class solution{
 public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        if(root!=null){
            dfs(res,root,0);
        }
        return res;
    }
    public void dfs(List<List<Integer>> res,TreeNode node,int level){
        if(res.size() - 1 <level){
             res.add(new ArrayList<Integer>());
        }
        res.get(level).add(node.val);
        if(node.left!=null){
            dfs(res,node.left,level+1);
        }
        if(node.right!=null){
            dfs(res,node.right,level+1);
        }
    }
}

107 之字形层序遍历

class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
        if (root == null) return res;
        Deque<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        int depth = 0;
        while (!queue.isEmpty()) {
            List<Integer> tmp = new LinkedList<>();
            int cnt = queue.size();
            for (int i = 0; i < cnt; i++) {
                TreeNode node = queue.poll();
                // System.out.println(node.val);
                if (depth % 2 == 0) tmp.add(node.val);
                else tmp.add(0, node.val);
                if (node.left != null) queue.add(node.left);
                if (node.right != null) queue.add(node.right);
            }
            res.add(tmp);
            depth++;
        }
        return res;
    }
}