首页 > 代码库 > LeetCode Validate Binary Search Tree
LeetCode Validate Binary Search Tree
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.
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */10 public class Solution {11 public boolean isValidBST(TreeNode root) {12 return checkBST(root,Long.MIN_VALUE,Long.MAX_VALUE);13 }14 15 private boolean checkBST(TreeNode node,long leftval,long rightval){16 if (node==null) return true;17 return leftval<node.val && node.val<rightval && checkBST(node.left,leftval,node.val)18 && checkBST(node.right,node.val,rightval);19 20 }21 }
LeetCode Validate Binary Search Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。