Given a binary tree, find height of it.
1
/ \
10 39
/
5
The above tree has a height of 3.
Note: Height of empty tree is considered 0.
Input Format:
The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains two lines of input. The first line contains number of edges. The second line contains relation between nodes.
Output Format:
For each testcase, in a new line, print the height of tree.
Your Task:
You don't have to take input. Complete the function height() that takes node as parameter and returns the height. The printing is done by the driver code.
Constraints:
1 <= T <= 100
1 <= Number of nodes <= 100
1 <= Data of a node <= 1000
Example:
Input:
2
2
1 2 L 1 3 R
4
10 20 L 10 30 R 20 40 L 20 60 R
Output:
2
3
Explanation:
Testcase1: The tree is
1
/ \
3 2
So, the height would be 2.
Testcase2: The tree is
10
/ \
20 30
/ \
40 60
So, height would be 3.
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.
| the_coder95 | 465 |
| thanuvinu94 | 388 |
| adityasuman2025 | 305 |
| Senbonzakura_Kageyoshi | 297 |
| PrakharBansal1 | 274 |
| the_coder95 | 1691 |
| RishabhTanwar1 | 1110 |
| thanuvinu94 | 1064 |
| samay_kam_hai | 724 |
| themanhasnoname | 620 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4897 |
| Quandray | 4547 |