Validate Binary Search Tree
来源:互联网 发布:淘宝是什么公司的 编辑:程序博客网 时间:2024/04/30 16:01
中序遍历,结果递增的话就说明是一颗二叉搜索树
这里用了一个trick,用prev保存前驱节点,dfs的同时做比较
class Solution {public: bool isValidBST(TreeNode* root) { TreeNode* prev = NULL; return validate(root, prev); } bool validate(TreeNode* node, TreeNode* &prev) { if (node == NULL) return true; if (!validate(node->left, prev)) return false; if (prev != NULL && prev->val >= node->val) return false; prev = node; return validate(node->right, prev); }};
0 0
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- Validate Binary Search Tree
- java 计算两个数的百分比,以百分号显示
- Hadoop概述
- RGB到HSI转换
- leetcode 345
- android 事件分发机制
- Validate Binary Search Tree
- 数据存储之SwiftJSON
- Android布局优化之include、ViewStub、merge
- android 动态获得资源ID
- 一天一条Linux指令-usleep
- 第三个问题:看看我们的项目编译后文件夹
- win7关联句柄轻松删除“正在使用的文件”
- sdl2_ttf基于ti交叉编译问题
- iOS webView以及WKWebView计算高度慢,加快加载速度等问题