leetcode dfs Validate Binary Search Tree
来源:互联网 发布:java基础知识体系结构 编辑:程序博客网 时间:2024/05/20 11:22
Validate Binary Search Tree
Total Accepted: 23828 Total Submissions: 91943My SubmissionsGiven 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.
题意:给定一棵二叉树,判断它是不是合法的二叉查找树
思路:dfs
合法二叉查找树必须满足以下两个条件
1.左子树和右子树都是合法二叉查找树
2.左子树的最右叶子节点 < 根 < 右子树的最左叶子节点
复杂度:时间O(n),空间O(log n)
bool isValidBST(TreeNode *root) {if(!root) return true;TreeNode *right_most = root->left, *left_most = root->right;while(right_most && right_most->right){right_most = right_most->right;}while(left_most && left_most->left){left_most = left_most->left;}return isValidBST(root->left) && isValidBST(root->right)&& (!right_most || right_most->val < root->val)&& (!left_most || root->val < left_most->val);}
0 0
- leetcode dfs Validate Binary Search Tree
- [leetcode] Validate Binary Search Tree dfs
- DFS Validate Binary Search Tree
- LeetCode-98-Validate Binary Search Tree dfs二叉树
- LeetCode: Validate Binary Search Tree
- [Leetcode] Validate Binary Search Tree
- LeetCode : Validate Binary Search Tree
- [LeetCode] Validate Binary Search Tree
- [LeetCode] Validate binary search tree
- [LeetCode]Validate Binary Search Tree
- [Leetcode]Validate Binary Search Tree
- [leetcode]Validate Binary Search Tree
- LeetCode-Validate Binary Search Tree
- [leetcode] Validate Binary Search Tree
- LeetCode - Validate Binary Search Tree
- [LeetCode] Validate Binary Search Tree
- Leetcode Validate Binary Search Tree
- LeetCode | Validate Binary Search Tree
- 小贝学习html--超链接
- 简述UITextField的属性和用法
- 『IOS』报错:failed to get the task for process XXX(解决方案)
- 在PowerShell中使用Vim
- 每天一个linux命令(5):rm 命令
- leetcode dfs Validate Binary Search Tree
- const_interator的用法
- Java NIO 系列教程
- Android背景平铺
- Anagram --- 哈希算法
- 蓝桥杯试题
- 3Sum Closest
- Java NIO系列教程(一) Java NIO 概述
- Android 编程下 Touch 事件的分发和消费机制