代码随想录算法训练营-day17-110. 平衡二叉树、257. 二叉树的所有路径

最新推荐文章于 2023-12-31 17:30:00 发布

依旧1919

最新推荐文章于 2023-12-31 17:30:00 发布

阅读量87

点赞数

分类专栏：代码随想录算法训练营文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_47067912/article/details/127815074

版权

代码随想录算法训练营专栏收录该内容

53 篇文章 0 订阅

订阅专栏

注：最近忙着实验！！！只能只写代码了！！！

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 getHeight(root) == -1 ? false : true;
    }

    public int getHeight(TreeNode node) {
        if (node == null) return 0;

        int leftDepth = getHeight(node.left);
        if (leftDepth == -1) return -1;
        int rightDepth = getHeight(node.right);
        if (rightDepth == -1) return -1;
        return Math.abs(leftDepth - rightDepth) > 1 ? -1 : 1 + Math.max(leftDepth, rightDepth);
    }
}

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

    }
    void traversal (TreeNode cur, List<Integer> path, List<String> res) {
        path.add(cur.val);
        if (cur.left == null && cur.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());
            return;
            
        }

        if (cur.left != null) {
            traversal(cur.left, path, res);
            path.remove(path.size() - 1);
        }
        if (cur.right != null) {
            traversal(cur.right, path, res);
            path.remove(path.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 {
    public int sumOfLeftLeaves(TreeNode root) {
        Deque<TreeNode> que = new LinkedList<>();
        int sum = 0;
        que.offer(root);
        while (!que.isEmpty()) {
            TreeNode node = que.poll();
            if (node.left != null && node.left.left == null && node.left.right == null) {
                sum += node.left.val;
            }
            if (node.left != null) que.offer(node.left);
            if (node.right != null) que.offer(node.right);
        }
        return sum;
    }
}