98. Validate Binary Search Tree

 

98. Validate Binary Search Tree

Medium

2566373FavoriteShare

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 thanthe 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.

 

Example 1:

    2
   / \
  1   3

Input: [2,1,3]
Output: true

Example 2:

    5
   / \
  1   4
     / \
    3   6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.

Accepted

502,442

Submissions

1,891,868

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
    	if(root==NULL) return true;
        vector<int> in;
        intra(root,in);
        set<int> st;
        for(int i=0;i<in.size();i++){
            st.insert(in[i]);
        }
        if(st.size()!=in.size()) return false;//有重复也是false
        vector<int> temp=in;
        sort(in.begin(),in.end());
        if(temp==in) return true;
        else return false;
    }
    void intra(TreeNode* root,vector<int>& in){
    	if(root==NULL) return;
    	intra(root->left,in);
    	in.push_back(root->val);
    	intra(root->right,in);
    }
};

 

另一种中序遍历的方法大同小异

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
    	if(root==NULL) return true;
        vector<int> in;
        intra(root,in);
        for(int i=1;i<in.size();i++){
            if(in[i]<=in[i-1]) return false;
        }
        return true;
    }
    void intra(TreeNode* root,vector<int>& in){
    	if(root==NULL) return;
    	intra(root->left,in);
    	in.push_back(root->val);
    	intra(root->right,in);
    }
};