Redirecting to
NADOS

Validate Bst

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

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.
Input Format 
Input is managed for you.
Output Format 
output is managed for you.
Question Video
Constraints 
0 <= Number of Nodes <= 10^9
-10^9 <= value of Node data <= 10^9
Sample Input 
13
7
3
2
-1
-1
5
-1
-1
10
-1
12
-1
-1
Sample Output 
true


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name