Given the root of a binary tree, determine if it is a valid binary search tree (BST).
Input: [2,1,3] Output: true Input: [5,1,4,null,null,3,6] Output: false
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features