17-算法训练营第十七天 |力扣110平衡二叉树、力扣257二叉树的所有路径、力扣404左叶子之和

力扣110：平衡二叉树

题目链接:力扣110：平衡二叉树

---

思路：

1.采用递归法和后序遍历
2.确定递归参数
3.确定递归终止条件
4.确定每层递归逻辑
5.分别判断左节点高度和右节点高度是否等于-1，如果等于则直接返回-1
6.判断左右节点高度差是否大于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 boolean isBalanced(TreeNode root) {
        // 1.采用递归法和后序遍历
        // 2.确定递归参数
        return getHeight(root) == -1 ? false : true;
    }

    private int getHeight(TreeNode root) {
        // 3.确定递归终止条件
        if (root == null) {
            return 0;
        }
        // 4.确定每层递归逻辑
        // 左
        int leftHeight = getHeight(root.left);
        if (leftHeight == -1) {
            return -1;
        }
        // 右
        int rightHeight = getHeight(root.right);
        if (rightHeight == -1) {
            return -1;
        }
        // 中
        // 判断左右节点高度差是否大于1
        if (Math.abs(leftHeight - rightHeight) > 1) {
            return -1;
        }
        return 1 + Math.max(leftHeight, rightHeight);
    }
}

---

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

题目链接:力扣257：二叉树的所有路径

---

思路：

---

代码：

class Solution {
    /**
     * 递归法
     */
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if (root == null) {
            return res;
        }
        List<Integer> paths = new ArrayList<>();
        traversal(root, paths, res);
        return res;
    }

    private void traversal(TreeNode root, List<Integer> paths, List<String> res) {
        paths.add(root.val);
        // 叶子结点
        if (root.left == null && root.right == null) {
            // 输出
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < paths.size() - 1; i++) {
                sb.append(paths.get(i)).append("->");
            }
            sb.append(paths.get(paths.size() - 1));
            res.add(sb.toString());
            return;
        }
        if (root.left != null) {
            traversal(root.left, paths, res);
            paths.remove(paths.size() - 1);// 回溯
        }
        if (root.right != null) {
            traversal(root.right, paths, res);
            paths.remove(paths.size() - 1);// 回溯
        }
    }
}

---

力扣404：左叶子之和

题目链接:力扣404：左叶子之和

---

思路：

1.递归法（后序遍历）

---

代码：

class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        stack<TreeNode*> st;
        if (root == NULL) return 0;
        st.push(root);
        int result = 0;
        while (!st.empty()) {
            TreeNode* node = st.top();
            st.pop();
            if (node->left != NULL && node->left->left == NULL && node->left->right == NULL) {
                result += node->left->val;
            }
            if (node->right) st.push(node->right);
            if (node->left) st.push(node->left);
        }
        return result;
    }
};

---