代码随想录算法训练营第十七天|二叉树part04| 110.平衡二叉树 257. 二叉树的所有路径 404.左叶子之和

 110.平衡二叉树 （优先掌握递归）Balanced Binary Tree - LeetCode

int getHeight(TreeNode root）

        if (node == null) return 0;

左     leftH = getHeight(root.left)

        if (leftH == -1) return -1;

右     rightH = getHeight(root.right);

        if (rightH == -1) return -1;

       int res;

        if (abs(leftH - rightH) > 1) res = -1;

        else

        res = 1 + max(leftH, rightH);

        return res;

感觉不咋简洁啊。。。

用了之前的方法

/**
 * 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 isBalanced(TreeNode root) {
        if (root == null) return true;
        int leftH = getHeight(root.left);
        int rightH = getHeight(root.right);
        if (Math.abs(leftH - rightH) > 1) return false;
        return isBalanced(root.left) && isBalanced(root.right);
    }
    private int getHeight(TreeNode root) {
        if (root == null) return 0;
        int left = getHeight(root.left);
        int right = getHeight(root.right);
        int height = Math.max(left, right) + 1;
        return height;
    }
}

257. 二叉树的所有路径 Binary Tree Paths - LeetCode

前序遍历

void traversal(TreeNode root, List<> path, List<> res)

中     path.add(root.val);

        

        if (root.left == null && root.right == null)

                res.add(path);

                return;

左    if(root.left != null)

                traversal(root.left, path, res);

        

                path.remove(path.size()-1);//回溯

右    if (root.right != null)

                path.remove(path.size() -1);//回溯

/**
 * 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 List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if (root == null) return res;
        List<Integer> path = new ArrayList<>();
        traversal(root, path, res);
        return res;
    }

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

 404.左叶子之和 Sum of Left Leaves - LeetCode

int traversal(TreeNode root)

        if (root == null) return 0;

        if (root.left == null && root.right == null) return 0;

左    int leftNum = traversal(root.left);

        if (root.left != null && root.left.left == null && root.left.right == null)

                leftNum = root.left.val;

右    int rightNum = traversal(root.right)

中    int sum = leftNum + rightNum;

        return sum;

/**
 * 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 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;
    }
}