Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Validate Binary Search Tree

Medium

00:00

0 users online

Given the root of a binary tree, determine if it is a valid binary search tree.

Sample Input:

[2,1,3]

Sample Output:

true

Hints

Hint 1

Use recursive validation with min/max bounds

Hint 2

Left subtree must be < node value, right subtree must be > node value

Hint 3

Update bounds as you traverse down the tree

Code Editor

Loading...