98. Validate Binary Search Tree(中序遍历判断BST)
来源:互联网 发布:大帝和雪兔分手知乎 编辑:程序博客网 时间:2024/05/20 12:21
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.
Example 1:
2 / \ 1 3Binary tree
[2,1,3]
, return true.Example 2:
1 / \ 2 3Binary tree
[1,2,3]
, return false.Subscribe to see which companies asked this question
分析:
就是判断一个给定的二叉树是否为二叉查找树。
我的思路是:先将该树中序遍历一遍,按中序遍历的顺序保存到一个vector中,然后判断vector中的顺序即可。
ac代码:
/**
* 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:
vector<int>v;
bool isValidBST(TreeNode* root) {
if(root==nullptr)
return true;
inorder(root);
int i,n=v.size();
for(i=1;i<n;i++)
if(v[i]<=v[i-1])
return false;
return true;
}
void inorder(TreeNode* root)
{
if(root->left)
inorder(root->left);
v.push_back(root->val);
if(root->right)
inorder(root->right);
}
};
- 98. Validate Binary Search Tree(中序遍历判断BST)
- Validate Binary Search Tree(二叉树前序、中序遍历)
- BST-----Validate Binary Search Tree
- 【LeetCode】 Recover Binary Search Tree BST 中序遍历
- Recover Binary Search Tree(BST中序遍历)
- 98.Validate Binary Search Tree&检查是否为BST
- leetcode99---Recover Binary Search Tree(morris中序遍历恢复BST)
- 【LeetCode】98. Validate Binary Search Tree 解法,中序遍历,搜索二叉树合法性
- BST(binary search tree)
- 【二叉树】BST中序遍历【99. Recover Binary Search Tree】
- leetcode 501. Find Mode in Binary Search Tree 二叉搜索树BST的中序遍历
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 最长公共子序列VS最长连续公共子序列
- 浅析 - TabLayout的基本用法
- BGRABitmap图像操作13:BGRABitmap的坐标系统
- c++备忘录2
- IntelliJ Idea 常用快捷键列表
- 98. Validate Binary Search Tree(中序遍历判断BST)
- 理解本真的REST架构风格
- 中国剩余定理(模板+代码)
- 文本格式化标签
- 跟我一起写 Makefile(一)
- Bootstrap-maxlength使用
- Xcode中的Info.plist字段列表详解
- LLL算法JAVA实现
- 剑指Offer面试题17(Java版):合并两个排序的链表