Validate Binary Search Tree | Dataford Interview Questions

Given the root of a binary tree, return True if it is a valid Binary Search Tree (BST), otherwise return False.

A valid BST requires that every node in the left subtree is strictly less than the current node, every node in the right subtree is strictly greater than the current node, and both subtrees must also be valid BSTs.

Constraints

The number of nodes is in the range [0, 10^4]
-2^31 <= Node.val <= 2^31 - 1
A valid BST requires all left subtree values < node.val < all right subtree values
Duplicates are not allowed in a valid BST

Function Signature

def is_valid_bst(root=None, val=None, left=None, right=None):

Your question is Validate Binary Search Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given the root of a binary tree, return True if it is a valid Binary Search Tree (BST), otherwise return False.

Constraints

The number of nodes is in the range [0, 10^4]
-2^31 <= Node.val <= 2^31 - 1
A valid BST requires all left subtree values < node.val < all right subtree values
Duplicates are not allowed in a valid BST

Function Signature

def is_valid_bst(root=None, val=None, left=None, right=None):

Your question is Validate Binary Search Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.