Leetcode_Validate Binary Search Tree

最新推荐文章于 2014-08-04 23:50:49 发布

PenyChow

最新推荐文章于 2014-08-04 23:50:49 发布

阅读量518

点赞数

分类专栏：数据结构&算法 Leetcode 文章标签： leetcode 数据结构算法

本文链接：https://blog.csdn.net/qq112928/article/details/38377203

版权

数据结构&算法同时被 2 个专栏收录

16 篇文章 0 订阅

订阅专栏

Leetcode

12 篇文章 0 订阅

订阅专栏

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.

class Solution {
public:
    void  isValid(TreeNode *root ,int &pre,bool &s) {
        if(root==NULL)
        return ;
        else{
         
          isValid(root->left,pre ,s);
        
          if(root->val <= pre ){
              s = false;
              return;
          }
          pre = root->val;
          isValid(root->right,pre,s);
          
          
          
        }
        
    }
    bool isValidBST(TreeNode *root) {
        bool s=true;
        int pre=-2000000;
         isValid(root,pre,s);
        return s;
    }
};