Diameter Of A Binary Tree

easy
 1. You are given a partially written BinaryTree class.
2. You are required to complete the body of diameter1 function. The function is expected to return the number of edges between two nodes which are farthest from each other in terms of edges.
3. Input and Output is managed for you. 

                               

Input Format

Input is managed for you.

Output Format

Output is managed for you.

Constraints

None

Notice

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.

Example

Input
19
50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n
Output
6
Previous
Print Nodes K Distance Away
Next
Tilt Of Binary Tree

Related Questions