@@ -0,0 +1,842 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Aclass Solution %7B%0A    %0A    /*%0A        %E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E7%9A%84%E6%96%B9%E5%BC%8F%E9%81%8D%E5%8E%86%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%AF%8F%E4%B8%80%E4%B8%AA%E7%BB%93%E7%82%B9%E3%80%82%0A%0A        %E5%9C%A8%E9%81%8D%E5%8E%86%E5%88%B0%E4%B8%80%E4%B8%AA%E7%BB%93%E7%82%B9%E4%B9%8B%E5%89%8D%E5%B7%B2%E7%BB%8F%E9%81%8D%E5%8E%86%E4%BA%86%E5%AE%83%E7%9A%84%E5%B7%A6%E5%8F%B3%E5%AD%90%E6%A0%91%EF%BC%8C%E9%82%A3%E4%B9%88%E5%8F%AA%E8%A6%81%E5%9C%A8%E9%81%8D%E5%8E%86%E6%AF%8F%E4%B8%AA%E7%BB%93%E7%82%B9%E7%9A%84%E6%97%B6%E5%80%99%E8%AE%B0%E5%BD%95%E5%AE%83%E7%9A%84%E6%B7%B1%E5%BA%A6%EF%BC%88%E6%9F%90%E4%B8%80%E7%BB%93%E7%82%B9%E7%9A%84%E6%B7%B1%E5%BA%A6%E7%AD%89%E4%BA%8E%E5%AE%83%E5%88%B0%E5%8F%B6%E7%BB%93%E7%82%B9%E7%9A%84%E8%B7%AF%E5%BE%84%E7%9A%84%E9%95%BF%E5%BA%A6%EF%BC%89%EF%BC%8C%E5%B0%B1%E5%8F%AF%E4%BB%A5%E4%B8%80%E8%BE%B9%E9%81%8D%E5%8E%86%E4%B8%80%E8%BE%B9%E5%88%A4%E6%96%AD%E6%AF%8F%E4%B8%AA%E7%BB%93%E7%82%B9%E6%98%AF%E4%B8%8D%E6%98%AF%E5%B9%B3%E8%A1%A1%E7%9A%84%E3%80%82%0A    */%0A    private boolean isBalanced = true;%0A    %0A    public boolean isBalanced(TreeNode root) %7B%0A        getDepth(root);%0A        return isBalanced;%0A    %7D%0A    %0A    public int getDepth(TreeNode root) %7B%0A        if (root == null) %7B%0A            return 0;%0A        %7D%0A        %0A        int left = getDepth(root.left);%0A        int right = getDepth(root.right);%0A        %0A        if (Math.abs(left - right) %3E 1) %7B%0A            isBalanced = false;%0A        %7D%0A        %0A        return right %3E left ? right + 1 : left + 1;%0A    %7D%0A%7D

add no.110