Workspace

Problem workspace

3 day streakD

Validate a BST

MediumTreesBinary search trees

The challenge

Check that every descendant follows strict BST ordering with respect to all its ancestors.

Duplicates are invalid. Empty trees are valid. Values are finite integers.

Example

The second example places 6 in the right subtree of 8: it is below parent 12 but still violates the lower bound 8.

Use the walkthrough below to inspect the input and each state change.

See Validate BST, step by step

Follow the branches. Watch the state change.

7 input nodesL = left · R = right
Inspect the input.Labels identify node objects; numbers are their values. Left and right child pointers define the tree. Node labels identify objects; numbers show their values. The pointer table below provides the same structure in text.LRLRLR2D4B6E8A · root10F12C14G
CurrentProcessedPending
View child pointers & node state
Node state · null means no child
NodeValueLeftRightState
A8BC—
B4DE—
C12FG—
D2nullnull—
E6nullnull—
F10nullnull—
G14nullnull—
Step 01 / 23

Inspect the input.

Labels identify node objects; numbers are their values. Left and right child pointers define the tree.

root = A:8
View original input

A:8 [L:B, R:C] · B:4 [L:D, R:E] · C:12 [L:F, R:G] · D:2 [L:null, R:null] · E:6 [L:null, R:null] · F:10 [L:null, R:null] · G:14 [L:null, R:null]

Node IDs stay distinct even when values repeat. Pointer mutations update the diagram; removed nodes remain in the state table for reference.

Put it into code

Pass an open interval of legal values down each path.

Nodes store value, left, and right. C++ uses C++17 or later.

from collections import deque

class Node:
    def __init__(self, value, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right

def is_valid_bst(root):
    def valid(node, low, high):
        if node is None:
            return True
        if not low < node.value < high:
            return False
        return (valid(node.left, low, node.value)
                and valid(node.right, node.value, high))
    return valid(root, float("-inf"), float("inf"))

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap