LeetCode Validate Binary Search Tree
2016-08-10 20:46
288 查看
这个题挺好的。考察了中序遍历。
用中序遍历就可以不用考虑子树的问题。中序遍历后查看数组是否递增就可以了。我第一遍做没有想到。以为是直接深搜，然后就卡在子树问题上了。。
用中序遍历就可以不用考虑子树的问题。中序遍历后查看数组是否递增就可以了。我第一遍做没有想到。以为是直接深搜，然后就卡在子树问题上了。。
class Solution {
public:
void judge(TreeNode* root,vector<int>&p)
{
if(!root)return;
judge(root->left,p);
p.push_back(root->val);
judge(root->right,p);
}
bool isValidBST(TreeNode* root) {
vector<int>p;
judge(root,p);
for(int i =1;i<p.size();++i)
if(p[i-1]>=p[i])return false;
return true;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【leetcode】Validate Binary Search Tree
- [LeetCode]Validate Binary Search Tree, 解题报告
- [Leetcode]@python 98. Validate Binary Search Tree
- [LeetCode][Java] Validate Binary Search Tree
- Leetcode: Validate Binary Search Tree
- LeetCode-Validate Binary Search Tree-合法二叉搜索树-二叉树递归
- LeetCode 98 Validate Binary Search Tree
- Leetcode 98 Validate Binary Search Tree
- LeetCode 98. Validate Binary Search Tree
- Validate Binary Search Tree -- leetcode
- LeetCode98 Validate Binary Search Tree
- Leetcode--Validate Binary Search Tree
- [Leetcode] Validate Binary Search Tree & Recover Binary Search Tree
- Leetcode-98: Validate Binary Search Tree
- 【leetcode】Validate Binary Search Tree
- 【leetcode】Validate Binary Search Tree 题解三种思路
- [leetcode刷题系列]Validate Binary Search Tree
- LeetCode_Validate Binary Search Tree
- leetcode -day26 Validate Binary Search Tree
- *Leetcode_validate-binary-search-tree