二叉树遍历

94中序

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

    private void order(TreeNode root, ArrayList res){
        if(root==null){
            return;
        }
        order(root.left, res);
        res.add(root.val);
        order(root.right, res);
    }
}

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new LinkedList<>();
        if(root==null) return res;
        Deque<TreeNode> queue = new LinkedList<>();
        queue.push(root);
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            if(node==null){
                res.add(queue.poll().val);
            }else{
                if(node.right!=null) queue.push(node.right);
                queue.push(node);
                queue.push(null);
                if(node.left!=null) queue.push(node.left);
            }
        }
        return res;
    }
}