代码随想录算法训练营day20| 654.最大二叉树，617.合并二叉树，700.二叉搜索树中的搜索，98.验证二叉搜索树

654.最大二叉树

654. 最大二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        //终止条件
        TreeNode* node = new TreeNode(0);
        if(nums.size()==1){
            node->val = nums[0];
            return node;
        }
        //找到最大值及其下标
        int maxValue = 0;
        int index = 0;
        for(int i=0; i<nums.size(); i++){
            if(nums[i]>maxValue) {
                maxValue = nums[i];
                index = i;
            }
        }
        node->val = maxValue;

        if(index > 0){
            vector<int> newvec(nums.begin(), nums.begin()+index);
            node->left = constructMaximumBinaryTree(newvec);
        }

        if(index < nums.size()-1){
            vector<int> newvec(nums.begin()+index+1, nums.end());
            node->right = constructMaximumBinaryTree(newvec);
        }
        return node;
    }
};

617.合并二叉树

617. 合并二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        //两树同步遍历
        if(root1==NULL) return root2;
        if(root2==NULL) return root1;

        root1->val += root2->val; // 中

        root1->left = mergeTrees(root1->left, root2->left); //左
        root1->right =  mergeTrees(root1->right, root2->right); //右

        return root1;
    }
};

700.二叉搜索树中的搜索

700. 二叉搜索树中的搜索

1.递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        if(root==NULL || root->val == val) return root;
        TreeNode* cur = new TreeNode(0);
        if(val < root->val) cur = searchBST(root->left, val);
        if(val > root->val) cur = searchBST(root->right, val);
        return cur;
    }
};

2.迭代

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        while(root){
            if(val < root->val){
                root = root->left;
            }
            else if(val > root->val){
                root = root->right;
            }
            else{
                return root;
            }

        }
        return NULL;
    }
};

98.验证二叉搜索树

98. 验证二叉搜索树

1.迭代

使用数组

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
        if(root==NULL) return true;
        vector<int> ans;
        TreeNode* cur = root;
        stack<TreeNode*> st;

        while(cur!=NULL || !st.empty()){
            if(cur!=NULL){
                st.push(cur);
                cur = cur->left;
            }
            else{
                cur = st.top();
                st.pop();
                ans.push_back(cur->val);
                cur = cur->right;
            }
        }
        for(int i=0; i<ans.size()-1; i++){
            if(ans[i] >= ans[i+1]) return false;
        }
        return true;
    }
};

不使用数组

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
        if(root==NULL) return true;
        stack<TreeNode*> st;
        TreeNode* cur = root;
        TreeNode* pre = NULL;
        while(!st.empty() || cur!=NULL){
            if(cur != NULL){
                st.push(cur);
                cur = cur->left;
            }
            else{
                cur = st.top();
                st.pop();
                if(pre!=NULL && cur->val <= pre->val) return false;
                pre = cur;
                cur = cur->right;
            }
        }
        return true;
    }
};

2.递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* pre = NULL;
    bool isValidBST(TreeNode* root) {
        //递归 中序
        if(root==NULL) return true;
        bool left = isValidBST(root->left); //左
        //中
        //前一个节点大于当前遍历的节点则不符合要求
        if(pre != NULL && root->val <= pre->val) return false;
        pre = root;
        bool right = isValidBST(root->right);//右
        return left && right; 
    }
};