Coding Interview PatternsValidate Binary Search Tree
MediumTree Depth-First Search

Validate Binary Search Tree

Explanation & Solution

Practice Problem

Description

Given the root of a binary tree, determine if it is a valid binary search tree where left subtree values are less than the node and right subtree values are greater.

Previous
Lowest Common Ancestor of a Binary Tree
Next
Kth Smallest Element in a BST