Created
September 18, 2020 10:09
-
-
Save iamprayush/082dc3929a6210cf62cd8a26de6dc42b to your computer and use it in GitHub Desktop.
Validate Binary Search Tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution: | |
def isValidBST(self, node, mini=-inf, maxi=inf): | |
if not node: | |
return True | |
if not mini < node.val < maxi: | |
return False | |
left_is_valid, right_is_valid = True, True | |
if node.left: | |
if node.left.val >= node.val: | |
left_is_valid = False | |
else: | |
left_is_valid = self.isValidBST(node.left, mini, min(maxi, node.val)) | |
if node.right: | |
if node.right.val <= node.val: | |
right_is_valid = False | |
else: | |
right_is_valid = self.isValidBST(node.right, max(mini, node.val), maxi) | |
return left_is_valid and right_is_valid |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment