【代码随想录Day17】110.平衡二叉树、257.二叉树的所有路径、404.左叶子节点之和

最新推荐文章于 2024-10-08 10:36:00 发布

joyboy0405

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量20

点赞数

文章标签：深度优先 leetcode 算法

本文链接：https://blog.csdn.net/weixin_38550348/article/details/130971539

版权

Day17

110.平衡二叉树

/**
 * 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) {
        return getDepth(root) == -1 ? false : true;
    }
    public int getDepth(TreeNode node) {
        if (node ==  null) return 0;
        int leftDep = getDepth(node.left);
        if (leftDep == -1) return -1;
        int rightDep = getDepth(node.right);
        if (rightDep == -1) return -1;
        return Math.abs(leftDep - rightDep) > 1 ? -1 : 1 + Math.max(leftDep, rightDep);
    }
}

257.二叉树的所有路径

/**
 * 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 {
        List<String> result = new ArrayList<>();
        public List<String> binaryTreePaths(TreeNode root) {
            List<Integer> tmp = new ArrayList<>();
            dfs(root, result, tmp);
            return result;
        }
        public void dfs (TreeNode node, List<String> result, List<Integer> tmp) {
            tmp.add(node.val);
            if (node.left == null && node.right == null) {
                String ans = "";
                for (int i = 0; i < tmp.size() - 1; i++) {
                    ans += tmp.get(i) + "->";
                }
                result.add(ans + tmp.get(tmp.size() - 1));
                return;
            }
            if (node.left != null) {
                dfs(node.left, result, tmp);
                tmp.remove(tmp.size() - 1);
            }
            if (node.right != null) {
                dfs(node.right, result, tmp);
                tmp.remove(tmp.size() - 1);
            }
        }
    }

404.左叶子节点之和

/**
 * 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 {
    int ans = 0;
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null) return 0;
        dfs (root);
        return ans;
    }

    public void dfs (TreeNode node) {
        if (node.left != null && node.left.left == null && node.left.right == null) ans += node.left.val;
        if (node.left != null) dfs(node.left);
        if (node.right != null) dfs(node.right);  
    }
}