validate-binary-search-tree
来源:互联网 发布:欧楷笔法 知乎 编辑:程序博客网 时间:2024/06/08 00:28
题目:
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.
confused what”{1,#,2,3}”means? > read more on how binary tree is serialized on OJ.
OJ’s Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where ‘#’ signifies a path terminator where no node exists below.
Here’s an example:
1
/ \
2 3
/
4
\
5
The above binary tree is serialized as”{1,2,3,#,#,4,#,#,5}”.
程序:
class Solution {public: bool isValidBST(TreeNode *root) { return solve(root,INT_MIN,INT_MAX); } bool solve(TreeNode *root,int l,int h) { if(root == NULL) return true; if(root->val <= l || root->val >= h) return false; return (solve(root->left,l,root->val) && solve(root->right,root->val,h)); }};
- 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
- 排序算法(直接插入,堆排,归并排序)
- gRPC学习笔记(一)
- socket 编程 服务器端-客户端
- 对于数据去重的处理-PDI导入前及数据库端的双重设定
- c/c++面试题2
- validate-binary-search-tree
- [iPhone]解决:手指按住不动时,屏幕也会上下抖动
- 左偏树简介(洛谷P3377题解)
- Solr区间查询背后原理
- 分治:循环赛日程表(递归+非递归)
- android7.0 电源(Power)键流程
- java 设计模式
- 齐一都在唱什么呢+歌词词云分析
- [DP]Codeforces 743E Vladik and cards