Validate Binary Search Tree
  1. 问题

    Given a binary tree, determine if it is a valid binary search tree (BST).

    Assume a BST is defined as follows:

    • The left subtree of a node contains only nodes with keys less than the node's key.
    • The right subtree of a node contains only nodes with keys greater than the node's key.
    • Both the left and right subtrees must also be binary search trees.
  2. 解答
    bool inorderl(struct TreeNode *root,int a)
    {
        if(root==NULL) return true;
        if(root->val>a || root->val==a)
           return false;
         return inorderl(root->left,a)&&inorderl(root->right,a);
    }
    
    bool inorderr(struct TreeNode *root,int a)
    {
        if(root==NULL) return true;
        if(root->val<a || root->val==a)
           return false;
         return inorderr(root->left,a)&&inorderr(root->right,a);
    }
    bool isleft(struct TreeNode *root,int a)
    {
        if(root==NULL) return true;
        if(root!=NULL && root->left==NULL) return true;
          
        return inorderl(root->left,a);  
         
         
    }
    bool isright(struct TreeNode *root,int b)
    {
        if(root==NULL) return true;
        if(root!=NULL && root->right==NULL) return true;
        
        return inorderr(root->right,b);
    }
    bool isValidBST(struct TreeNode* root) 
    {
        if(root==NULL) return true;
        if(!root->left && !root->right) return true;
        if(isleft(root,root->val)==false || isright(root,root->val)==false)
            return false;
          
       if(root->left && root->right)
        return isValidBST(root->left)&&isValidBST(root->right);
       if(root->left && !root->right)
         return isValidBST(root->left);
          if(!root->left && root->right)
         return isValidBST(root->right);
        
    }


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012201343/article/details/49947857
文章标签: 二叉树
个人分类: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Validate Binary Search Tree

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭