30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 98. Validate Binary Search Tree

Determine whether a binary tree is a valid binary search tree by checking that each node's value is strictly greater than all values in its left subtree and strictly less than all values in its right subtree. This requires a traversal that enforces global min/max bounds from ancestors (or equivalently verifies an inorder traversal yields a strictly increasing sequence).

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late May, 2025

Amazon

Junior

Check if a given tree is valid BST, implement edge cases and implement in another way

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 98. Validate Binary Search Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact