98. Validate Binary Search Tree
来源:互联网 发布:2015网络零售交易额 编辑:程序博客网 时间:2024/06/06 10:55
问题描述:
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.解题思路:
该题是让判断一棵二叉树是否是一颗二分搜索树,即:左小于根,根小于右。故可以用dfs来给出中序排序顺序,再判断是否递增即可。
class Solution {
public:
bool isValidBST(TreeNode* root) {
if(root==NULL) return true;
vector<int> nums;
inOrder(root,nums);
for(int i=0;i<nums.size()-1;i++){
if(nums[i]>=nums[i+1])
return false;
}
return true;
}
void inOrder(TreeNode* root,vector<int> &num)
{
if(root==NULL) return;
inOrder(root->left,num);
num.push_back(root->val);
inOrder(root->right,num);
}
};
阅读全文
0 0
- 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
- 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
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- HTTP协议图解
- 亚马逊专家揭秘:如何建立自动检测乳腺癌的深度学习模型
- 用Scp传输本地和linux服务器之间的文件
- TK1学习笔记七:配置SSH远程访问
- HDU2568 前进【水题】
- 98. Validate Binary Search Tree
- Java sleep和wait实例比较
- 欢迎使用CSDN-markdown编辑器
- 堆栈模拟数学表达式
- Ubuntu 安装 TensorFlow
- Python 加密速查表
- JAVA进程与线程
- TFLearn 的 安装错误
- FDDI