Write a function to find the depth of a binary tree.

Answer Posted / prakhar

//simple 2 liner
int depth(Node *n)
{
if (n==NULL) return 0;
return ( max( depth(n->left) , depth(n->right) ) + 1 )
}

Is This Answer Correct ?    1 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql

2417


how to programme using switch statements and fuctions, a programme that will output two even numbers, two odd numbers and two prime numbers of the users chioce.

2147


Write a routine to implement the polymarker function

4388


Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange

2867


create a C-code that will display the total fare of a passenger of a taxi if the driver press enter,the timer will stop. Every 10 counts is 2 pesos. Initial value is 25.00

6319






could you please send the program code for multiplying sparse matrix in c????

3078


What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?

3720


Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines

3036


How do you verify if the two sentences/phrases input is an anagram using predefined functions in string.h and by using arrays?

2032


how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns

3131


How to palindrom string in c language?

8895


Develop a routine to reflect an object about an arbitrarily selected plane

3004


I need your help, i need a Turbo C code for this problem.. hope u'll help me guys.? Your program will have a 3x3 array. The user will input the sum of each row and each column. Then the user will input 3 values and store them anywhere, or any location or index, temporarily in the array. Your program will supply the remaining six (6) values and determine the exact location of each value in the array. Example: Input: Sum of row 1: 6 Sum of row 2: 15 Sum of row 3: 24 Sum of column 1: 12 Sum of column 2: 15 Sum of column 3: 18 Value 1: 3 Value 2: 5 Value 3: 6 Output: Sum of Row 1 2 3 6 4 5 6 15 7 8 9 24 Sum of Column 12 15 18 Note: Your program will not necessary sort the walues in the array Thanks..

2813


how to test pierrot divisor

2264


What is data _null_? ,Explain with code when u need to use it in data step programming ?

2829