代码随想录算法训练营第十七天

二叉树相关

今天的题目按照递归做法基本是一种套路

110.平衡二叉树

参考文章
题目链接

个人题解

class Solution {
     public boolean isBalanced(TreeNode root) {
         return getHeight(root) != -1;
     }

     private int getHeight(TreeNode root) {
         if (root == null) {
             return 0;
         }
         int leftHeight = getHeight(root.left);
         if (leftHeight == -1) {
             return -1;
         }
         int rightHeight = getHeight(root.right);
         if (rightHeight == -1) {
             return -1;
         }

         if (Math.abs(leftHeight - rightHeight) > 1) {
             return -1;
         }
         return Math.max(leftHeight, rightHeight) + 1;
     }

 }

257. 二叉树的所有路径

参考文章
题目链接

个人题解

class Solution {
    List<String> result = new ArrayList<>();
    public List<String> binaryTreePaths(TreeNode root) {
        process(root, "");
        return result;
    }

    private void process(TreeNode node, String s) {
        if (node == null) {
            return;
        }
        if (node.left == null && node.right == null) {
            result.add(new StringBuilder(s).append(node.val).toString());
            return;
        }
        String temp = new StringBuilder(s).append(node.val).append("->").toString();
        process(node.left, temp);
        process(node.right, temp);
    }
}

404.左叶子之和

参考文章
题目链接

个人题解

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftValue = sumOfLeftLeaves(root.left);    // 左
        int rightValue = sumOfLeftLeaves(root.right);  // 右

        int midValue = 0;
        if (root.left != null && root.left.left == null && root.left.right == null) {
            midValue = root.left.val;
        }
        int sum = midValue + leftValue + rightValue;  // 中
        return sum;
    }
}