首页 > 代码库 > [leetcode] 98 Validate Binary Search Tree
[leetcode] 98 Validate Binary Search Tree
问题描述:
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 keysless than the node‘s key.
- The right subtree of a node contains only nodes with keysgreater than the node‘s key.
- Both the left and right subtrees must also be binary search trees.
代码:
bool isValidBST(TreeNode *root) { //C++ if(root == NULL||(root->left==NULL &&root->right==NULL)) return true; int pre; bool isFirst = true; stack<TreeNode*> myStack; TreeNode* p = root; while(p!=NULL || !myStack.empty()) { while(p!=NULL){ myStack.push(p); p = p->left; } p = myStack.top(); if(isFirst){ isFirst = false; pre = p->val; } else{ if(p->val <=pre) return false; pre = p->val; } myStack.pop(); p = p->right; } return true; }
[leetcode] 98 Validate Binary Search Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。