【第18天|二叉树5|● 513.找树左下角的值 ● 112. 路径总和 113.路径总和ii ● 106.从中序与后序遍历序列构造二叉树 105.从前序与中序遍历序列构造二叉树】-CSDN博客

本文链接：https://blog.csdn.net/fang_guobing/article/details/130587640

513.找树左下角的值

class Solution {//递归
    int res=0;
    int max_depth = 0;
    void traversal(TreeNode* root, int depth)
    {
        
        if(!root->left&&!root->right)
        {
            if(depth>max_depth)
            {
                max_depth  = depth;
                res = root->val;
            }
        }
        if(root->left) traversal(root->left,depth+1);
        if(root->right) traversal(root->right, depth+1);
        
    }
public:
    int findBottomLeftValue(TreeNode* root) {
        traversal(root, 1);
        return res;
    }
};

class Solution {//迭代
  
public:
    int findBottomLeftValue(TreeNode* root) {
         queue<TreeNode*> que;
        if (root != NULL) que.push(root);
        int result = 0;
        while (!que.empty()) {
            int size = que.size();
            for (int i = 0; i < size; i++) {
                TreeNode* node = que.front();
                que.pop();
                if (i == 0) result = node->val; // 一行的第一个元素
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            }
        }
        return result;
    }
};

112. 路径总和

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        if(root==NULL) return false;//如果是空节点直接返回false
        targetSum -= root->val; //减去当前节点的值
        if(!root->left && !root->right)//如果是叶子节点，判断target是否减到0了，如果没有就返回false；
        {
            if(targetSum==0) return true;
            else return false;
        } 
        if(root->left)//如果左子树存在就可以玩左走
        {
            bool left = hasPathSum(root->left, targetSum);  
            if(left==true) return true;//如果左子树返回了true说明存在路径，直接返回true右子树可以不看了
        }
        if(root->right){
            bool right = hasPathSum(root->right, targetSum);
            if(right==true) return true;//如果右子树返回true也可直接返回true
        }
        return false;//如果左右子树都没有路径，就返回false
    }
};

113.路径总和ii

class Solution {
    vector<vector<int>> res;
    vector<int>path;
    void traversal(TreeNode* root, int targetSum)
    {
        path.push_back(root->val);
        targetSum -= root->val;
        if(!root->left&&!root->right)
        {
            if(targetSum == 0) res.push_back(path);
        }
        if(root->left){
           traversal(root->left, targetSum);
           path.pop_back();
        }
        if(root->right) 
        {
            traversal(root->right, targetSum);
            path.pop_back();
        }
        return;
    }
public:
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        if(root==NULL) return res;
        traversal(root, targetSum);
        return res;
    }
};