Validate Bst
easy
1. You are given a partially written function to solve. 2. Determine if it is a valid binary search tree (BST). 3. A valid BST is defined as follows: 3.1 The left subtree of a node contains only nodes with keys less than the node's key. 3.2 The right subtree of a node contains only nodes with keys greater than the node's key. 3.3 Both the left and right subtrees must also be binary search trees.
Constraints
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Format
Input
Input is managed for you.
Output
output is managed for you.
Example
Sample Input
13
7
3
2
-1
-1
5
-1
-1
10
-1
12
-1
-1
Sample Output
true
Question Video