Given a binary tree, find its height.
Example 1:
Input:
1
/ \
2 3
Output: 2
Example 2:
Input:
2
\
1
/
3
Output: 3
Your Task:
You don't need to read input or print anything. Your task is to complete the function height() that takes root Node of the Tree as input and returns the Height of the Tree. If the Tree is empty, return 0.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).
Constraints:
1 <= Number of nodes <= 105
1 <= Data of a node <= 105
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.
| Umakant_Dubey | 314 |
| binod_gotiyo | 307 |
| lone_walker | 304 |
| NaveenGarg2 | 235 |
| ArpitGupta8 | 233 |
| saiujwal13083 | 799 |
| ppsvikhyat17 | 712 |
| generic_coder | 630 |
| lone_walker | 590 |
| 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:
1 2 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:
1 2 3