第15天代码随想录打卡

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();
        List<List<Integer>> res = new LinkedList<List<Integer>>();
        if(root == null)
            return res;
        queue.offer(root);
        while(!queue.isEmpty()){
            List<Integer> level = new LinkedList<>();
            int levelsize = queue.size();
            for(int i=1;i<=levelsize;i++){
                TreeNode tmp = queue.poll();
                if(tmp.left!=null)
                    queue.offer(tmp.left);
                if(tmp.right!=null)
                    queue.offer(tmp.right);
                
                level.add(tmp.val);
            }
            res.add(level);
        }
       return res;
 
    }
}

add,offer,push和poll,remove要分清楚

class Solution {

    public TreeNode invertTree(TreeNode root) {
        if(root == null){
            return null;
        }
        TreeNode left = invertTree(root.left);
        TreeNode right = invertTree(root.right);
        root.left = right;
        root.right = left;
        return root;



      
    }
}

思维很固化，在分析思路的时候，思路是对的，可能不够确定清晰，但其实是对的。在写的时候，又会被上一个题目影响到

class Solution {

    
    public boolean issame(TreeNode root1,TreeNode root2){
        if(root1==null&&root2==null)
            return true;
        if(root1==null||root2==null)
            return false;
       
        return issame(root1.left,root2.right)&&issame(root1.right,root2.left)&&(root1.val == root2.val);
        
    }
    public boolean isSymmetric(TreeNode root) {
        
        boolean res = issame(root,root);

        return res;
        

    }
}