98. Validate Binary Search Tree
来源:互联网 发布:秦时明月知乎 编辑:程序博客网 时间:2024/06/05 06:17
判断是否是BST,需要注意的是你不能只判断root的左儿子小于根节点,根节点小于右儿子,而是需要保证右子树所有的点都要大于根节点,左子树所有的点都小于根节点。所以可以做中序遍历,然后判断遍历所得的数组,是否是递增的。
class Solution {public:vector<int> n; bool isValidBST(TreeNode* root) { n.clear(); inorder(root); for(int i = 1; i < n.size(); i++) if(n[i] <= n[i - 1])return false; return true; } void inorder(TreeNode* root) { if(root == NULL)return ; inorder(root->left); n.push_back(root->val); inorder(root->right); }};
阅读全文
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
- Oracle笔记(一)——创建虚拟机和安装centos7
- C++批判
- 《linux命令行与shell脚本编程大全》第三版
- Linux 中 shell 中反引号与 $() 的对比
- SSD配置、训练、测试以及应用到自己的数据集
- 98. Validate Binary Search Tree
- SDL教程(1)
- Latex error:cannot determine size of graphic
- 程序流程控制(二)--三元运算符
- Problem B. Patterns Overlap Google Kickstart Round A 2017
- Android Study 之 findViewById 变迁之路
- IP地址 网段的划分
- 图像识别中的深度学习
- Linux下安装OpenCV 3.0