【代码随想录37期】Day18 找树左下角的值、路径总和、从中序与后序遍历序列构造二叉树

找树左下角的值

class Solution {
public:
    int findBottomLeftValue(TreeNode *root) {
        TreeNode *node;
        queue<TreeNode *> q;
        q.push(root);
        while (!q.empty()) {
            node = q.front(); q.pop();
            if (node->right) q.push(node->right);
            if (node->left)  q.push(node->left);
        }
        return node->val;
    }
};

路径总和

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        if (!root) {
            return false;
        }
        // que.second 存储父节点之前路经和
        queue<pair<TreeNode*, int>> que;
        que.emplace(root, 0);
        while (!que.empty()) {
            TreeNode* node = que.front().first;
            int pre_sum = que.front().second;
            que.pop();
            auto cur_sum = pre_sum + node->val;
            if (!node->left && !node->right && cur_sum == targetSum) {
                return true;
            }

            if (node->left) {
                que.emplace(node->left, cur_sum);
            }
            if (node->right) {
                que.emplace(node->right, cur_sum);
            }
        }

        return false;
    }
};

从中序与后序遍历序列构造二叉树

class Solution {
public:
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        unordered_map<int, int> d;
        int n = inorder.size();
        for (int i = 0; i < n; ++i) {
            d[inorder[i]] = i;
        }
        function<TreeNode*(int, int, int)> dfs = [&](int i, int j, int n) -> TreeNode* {
            if (n <= 0) {
                return nullptr;
            }
            int v = postorder[j + n - 1];
            int k = d[v];
            auto l = dfs(i, j, k - i);
            auto r = dfs(k + 1, j + k - i, n - k + i - 1);
            return new TreeNode(v, l, r);
        };
        return dfs(0, 0, n);
    }
};