Height of a Binary Tree

[bhargav41]

Problem Statement :- To find the height of the binary tree. The height of a binary tree is the number of edges between the tree's root and its furthest leaf.

Input: :- The first line contains an integer n, the number of nodes in the tree.
Next line contains n space separated integer where ith integer denotes node[i].data.

Example:-

Input:-
7
3 5 2 1 4 6 7

Output:-
3

Approach:-
We can use a recursive function , of type integer ,with base condition being to return 0 when the current node is leaf node. Else we will call the function recursively to the left , then the right and at the end return the MAX of left subtree and right subtree and add 1 to it.

[bhargav41]

please assign this issue to me

[spao234]

Please assign this issue to me

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!