Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Validate Binary Search Tree

Explore how to determine if a binary tree meets the properties of a binary search tree. Learn to check node values recursively, ensuring left subtree values are less and right subtree values are greater, while validating the entire tree structure.

We'll cover the following...

Statement

Given the root of a binary tree, check whether it is a valid binary search tree (BST).

A binary tree is a valid BST if for every node:

  • 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 are valid BSTs.

Constraints:

  • −104≤-10^{4} \leq Node.data ≤104\leq 10^{4}

  • The tree contains nodes in the range [1,500][1, 500].

Examples

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Valid Binary Search Tree

1.

Is the following binary tree a valid binary search tree?

  9
 / \
2  10
   / \
  7  20
A.

True

B.

False

1 / 3

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5
6

Try it yourself

Implement your solution in the following coding playground.

Python
usercode > main.py
# Definition for a binary tree node

# class TreeNode:

#     def __init__(self, data):

#         self.data = data

#         self.left = None

#         self.right = None



from ds_v1.BinaryTree.BinaryTree import TreeNode

import math



def validate_bst(root):



    # Replace this placeholder return statement with your code

    return False
Validate Binary Search Tree