Validate Binary Search Tree 🌲

Description Chat Solution

{{ current_question_unmet_requirement.title }} {{ user_message.course_message.title }}

Admin Delete

✅ ❌ {{ c.title }}

✅ ❌ {{ user_message.number_answer }}

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

A valid BST is defined as follows:

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 must also be binary search trees.

Problem at Leetcode.