第二题，0.2，将数组排序后，构建二叉排序树，然后对树中的每个节点进行判断，是否满足题意，不知道哪里出了问题。感觉没错啊             Arrays.sort(res);         //将排序数组转化成二叉排序树             TreeNode root=arrayToTreeNode(res,0,res.length-1);             if (root==null){                 System.out.println("NO");             }else{                 Queue<TreeNode> queue=new LinkedList<>();                 queue.add(root);                 boolean flag=true;                 int n=res.length;                 int temp=Math.min(11,n/2);                 while (!queue.isEmpty()){                     TreeNode cur=queue.poll();                     if (!Ablance(cur,temp)){                         flag=false;                         break;                     if (cur.left!=null){                         queue.add(cur.right                     if (cur.right!=null){                         queue.add(cur.right)                 if (flag){                     System.out.println("YES");                 }else{                     System.out.println("NO")