leetcode--二叉树1

102. 二叉树的层序遍历
     给你二叉树的根节点 root ，返回其节点值的层序遍历 。(即逐层地，从左到右访问所有节点）。

示例 1：

输入：root = [3,9,20,null,null,15,7]
输出：[[3],[9,20],[15,7]]
示例 2：

输入：root = [1]
输出：[[1]]
示例 3：

输入：root = []
输出：[]

/**
 * 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 {
   
    List<List<Integer>> res = new ArrayList<List<Integer>>();
    public List<List<Integer>> levelOrder(TreeNode root) {
   
        
        BFS(root);
        return res;
    }
	// 广度优先
    public void BFS(TreeNode node){
   
        if(node == null){
   
            return;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(node);
        while(!queue.isEmpty()){
   
            List<Integer> item = new ArrayList<>();
            int len = queue.size();
            while(len > 0){
   
                TreeNode tmp = queue.poll();
                item.add(tmp.val);

                if(tmp.left != null){
   
                    queue.offer(tmp.left);
                }
                if(tmp.right != null){
   
                    queue.offer(tmp.right);
                }
                len--;
            }
            res.add(item);
        }
    }
}

101. 对称二叉树
给你一个二叉树的根节点 root ， 检查它是否轴对称。

示例 1：

输入：root = [1,2,2,3,4,4,3]
输出：true

/**
 * 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 boolean isSymmetric(TreeNode root) {
   
        return compare(root.left, root.right);
    }

    private boolean compare(TreeNode left, TreeNode right){
   
        if(left == null && right != null){
   
            return false;
        }
        if(left != null && right == null){
   
            return false;
        }
        if(left == null && right == null){