[Feature Request]: Leetcode Problem: 98 #872
Labels
documentation
Improvements or additions to documentation
enhancement
New feature or request
good first issue
Good for newcomers
gssoc
GirlScript Summer of Code | Contributor
GSSOC'24
GirlScript Summer of Code | Contributor
level2
GirlScript Summer of Code | Contributor's Levels
Is there an existing issue for this?
Feature Description
I want to add solution to this problem
Validate Binary search tree(98):
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 subtreeof 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.
Use Case
For users to be able to see the solutions and understand it.
Benefits
No response
Add ScreenShots
No response
Priority
High
Record
The text was updated successfully, but these errors were encountered: