Given a binary tree. Check whether it is a BST or not.
Example 1:
Input:
2
/ \
1 3
Output: 1
Example 2:
Input:
2
\
7
\
6
\
5
\
9
\
2
\
6
Output: 0
Your Task:
You don't need to read input or print anything. Your task is to complete the function isBST() which takes the root of the tree as a parameter and returns true if the given binary tree is BST, else returns false. The printing is done by the driver's code.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the BST).
Constraints:
0 <= Number of edges <= 100000
Note: The Input/Output format and Example are given are used for the system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from the stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| lone_walker | 398 |
| 2isprime | 337 |
| Umakant_Dubey | 314 |
| rathindran | 262 |
| saiujwal13083 | 251 |
| saiujwal13083 | 889 |
| ppsvikhyat17 | 712 |
| lone_walker | 684 |
| generic_coder | 630 |
| NaveenGarg2 | 554 |
| blackshadows | 5448 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
2 1 3
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
2 1 3