【JAVA】144.前序遍历（迭代法）|94.二叉树的中序遍历(迭代法) | 102.二叉树的层序遍历 | 199.二叉树的右视图

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        if (root == null){
            return result;
        }
        //新建栈
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.pop();
            //从栈中拿出一个放入列表
            result.add(node.val);
            if (node.right != null){
                stack.push(node.right);
            }
            if (node.left != null){
                stack.push(node.left);
            }
        }
        return result;
    }
}

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        if(root == null){
            return result;
        }
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while (!stack.isEmpty() || cur != null){
            if(cur != null){
                stack.push(cur);
                cur = cur.left;
            }else{
                cur = stack.pop();
                result.add(cur.val);
                cur = cur.right;
            }
        }
        return result;
    }
}

class Solution {
    public List<List<Integer>> resList = new ArrayList<List<Integer>>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        checkFun(root,0);
        return resList;    
    }
    //递归算法
    public void checkFun(TreeNode node, Integer deep){
        if (node == null)return;
        deep++;
        if (resList.size() < deep){
            List<Integer> item = new ArrayList<Integer>();
            resList.add(item);
        }
        resList.get(deep -1).add(node.val);

        checkFun(node.left, deep);
        checkFun(node.right, deep);
    }
}

//今天好累，刷最后一道题的时候已经没有灵魂了
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Deque<TreeNode> que = new LinkedList<>();

        if (root == null){
            return list;
        }
        que.offerLast(root);//offerLast()和add()效果又是一样的;将元素链接到队列尾
        while (!que.isEmpty()){
            int levelSize = que.size();
            for(int i =0 ; i < levelSize; i++){
                TreeNode poll = que.pollFirst();
                if(poll.left != null){
                    que.addLast(poll.left);
                }
                if(poll.right != null){
                    que.addLast(poll.right);
                }
                if (i == levelSize - 1){
                    list.add(poll.val);
                }

            }
        
        }
        return list;
    }
}