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

Solution: Validate Binary Search Tree

Explore how to validate whether a binary tree is a valid binary search tree by using in-order traversal. Learn to check node values in ascending order to confirm BST properties and understand the time and space complexities of this approach.

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 ...