2 posts tagged with "Binary Search Tree"

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None


class Solution:
    def lowestCommonAncestor(self, root, p, q):
        if root.val > max(p.val, q.val):
            return self.lowestCommonAncestor(root.left, p, q)
        if root.val < min(p.val, q.val):
            return self.lowestCommonAncestor(root.right, p, q)
        return root

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isValidBST(self, root, lo=float('-inf'), hi=float('inf')) -> bool:
        '''
        [5,4,6,null,null,3,7] => false
        '''
        return (not root) or all(
            [
                lo < root.val < hi,
                self.isValidBST(root.left, lo, root.val),
                self.isValidBST(root.right, root.val, hi),
            ]
        )