代码随想录第17天: 二叉树part04

力扣110: 平衡二叉树

class Solution {
    public boolean isBalanced(TreeNode root) {
        int result = getHeight(root);
        if(result == -1) return false;
        else return true;
    }

    public int getHeight(TreeNode node) {
        if(node == null) return 0;
        int leftHeight = getHeight(node.left);
        if(leftHeight == -1) return -1;
        int rightHeight = getHeight(node.right);
        if(rightHeight == -1) return -1;
        int result;
        if(Math.abs(leftHeight - rightHeight) > 1) result = -1;
        else result = 1 + Math.max(leftHeight, rightHeight);
        return result;
    }
}

力扣257: 二叉树的所有路径

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if(root == null) return res;
        List<Integer> path = new ArrayList<>();
        traversal(root, res, path);
        return res;
    }

    public void traversal(TreeNode root, List<String> res, List<Integer> path) {
        path.add(root.val);
        if(root.right == null && root.left == null) {
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < path.size() - 1; i++) {
                sb.append(path.get(i));
                sb.append("->");
            }
            sb.append(path.get(path.size() - 1));
            res.add(sb.toString());
        }
        if(root.left != null) {
            traversal(root.left, res, path);
            path.remove(path.size() - 1);
        }
        if(root.right != null) {
            traversal(root.right, res, path);
            path.remove(path.size() - 1);
        }
    }
}

力扣404: 左叶子之和

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        if(root.left == null && root.right == null) return 0;
        int leftSum = sumOfLeftLeaves(root.left);
        if(root.left != null && root.left.left == null && root.left.right == null) leftSum = root.left.val;
        int rightSum = sumOfLeftLeaves(root.right);
        int sum = leftSum + rightSum;
        return sum;
    }
}