leetcode 98. Validate Binary Search Tree和700. Search in a Binary Search Tree

最新推荐文章于 2025-08-17 23:28:34 发布

洞阳

最新推荐文章于 2025-08-17 23:28:34 发布

阅读量186

点赞数 9

CC 4.0 BY-SA版权

分类专栏：二叉树 leetcode 文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/weixin_41554427/article/details/148748422

leetcode 同时被 2 个专栏收录

119 篇文章

订阅专栏

二叉树

5 篇文章

订阅专栏

98. Validate Binary Search Tree

迭代法中序遍历

递归法中序遍历

700. Search in a Binary Search Tree

迭代法：

递归法

98. Validate Binary Search Tree

迭代法中序遍历

/**
 * 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) {
        stack<TreeNode*> S;
        TreeNode* pre = nullptr;
        TreeNode* p = root;
        while(p || S.size()){
            if(p){
                S.push(p);
                p = p->left;
            }else{
                p = S.top();
                if(pre != nullptr && pre->val >= p->val)
                    return false;
                pre = p;
                S.pop();
                p = p->right;
            }
        }
        return true;
    }
};

递归法中序遍历

代码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 {
    long long leftmax = LONG_MIN;
public:
    bool isValidBST(TreeNode* root) {
        if(root == nullptr) return true;
        bool left = isValidBST(root->left);
        if(leftmax < root->val){
            leftmax = root->val;
        }else{
            return false;
        }
        bool right = isValidBST(root->right);
        return left&&right;
    }
};

代码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 {
    TreeNode* pre = nullptr;
public:
    bool isValidBST(TreeNode* root) {
        if(root == nullptr) return true;
        bool left = isValidBST(root->left);
        if(pre && pre->val >= root->val)
            return false;
        pre = root;
        bool right = isValidBST(root->right);
        return left&&right;
    }
};

700. Search in a Binary Search Tree

迭代法：

/**
 * 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(root->val == val)
                return root;
            else if(root->val > val)
                root = root->left;
            else
                root = root->right;
        }
        return nullptr;
    }
};

递归法

/**
 * 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 == nullptr || root->val == val)
            return root;
        if(root->val > val)
            return searchBST(root->left,val);
        else
            return searchBST(root->right,val);
        return nullptr;
    }
};