leetcode 94: Validate Binary Search Tree
来源:互联网 发布:spss24 for mac破解版 编辑:程序博客网 时间:2024/05/22 16:38
Validate Binary Search Tree Aug 31 '126322 / 18211
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.
Write a function isBST(BinaryTree *node) to verify if a given binary tree is a Binary Search Tree (BST) or not
1. every node must be greater than left node and less than right node.
2. also must be less than parent if left child or greater than parent if right child.
java 1. (NULL null) 2. (-> .) 3. ( !treenode treenode==null) 4. (INT_MIN Integer.MIN_VALUE)
class Solution {public: bool isBinarySearchTree(TreeNode * root ) { // Start typing your C/C++ solution below // DO NOT write int main() function return isBST( root, INT_MIN, INT_MAX); } bool isBST( TreeNode* root, int Min, int Max) { if(!root) return true; if( root->val > Min && root->val < Max) { return isBST( root->left, Min, root->val) && isBST( root->right, root->val, Max); } else { return false; } }};
java version
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public boolean isValidBST(TreeNode root) { // Start typing your Java solution below // DO NOT write main() function return isValidRec(root, Integer.MIN_VALUE, Integer.MAX_VALUE); } public boolean isValidRec(TreeNode root, int min, int max) { if( root==null ) return true; int val = root.val; if( val <= min || val >= max) return false; return isValidRec( root.left, min, val) && isValidRec(root.right, val, max); }}
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool isValidBST(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(root==NULL) return true; return validRec(root, INT_MIN, INT_MAX); }private: bool validRec(TreeNode *root, int min, int max) { if( root->val <= min || root->val >= max) return false; bool x=true, y=true; if(root->left) x=validRec(root->left, min, root->val); if(root->right) y=validRec(root->right, root->val, max); return x && y; } };
- leetcode 94: 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
- LeetCode | Validate Binary Search Tree
- LeetCode - Validate Binary Search Tree
- Leetcode: Validate Binary Search Tree
- 【Leetcode】Validate Binary Search Tree
- python 安装升级
- 使用大白菜超级U盘启动盘制作工具十分钟装完WIN7(大白菜启动盘+大白菜win7)
- Android系统资源访问机制的探讨
- Batch update returned unexpected row count from update [0]; actual row count: 3; expected: 1
- 链表逆转的一个算法
- leetcode 94: Validate Binary Search Tree
- 计算机专业就业指导(Java)之基础技术测试篇(四)
- 网络协议的思考
- 电脑Bois中usb模式启动热键
- JFontChooser java 自定义的字体选择器
- C语言之局部变量和全局变量
- 致国内开源软件作者的一封信
- 项目5-数组的排序
- css之FILTER:progid:DXImageTransform.Microsoft.Gradient使用