Write a function to find the depth of a binary tree.
- 13 Answers
- 86038 Views
- Adobe, Amazon, EFI, Imagination Technologies, I also Faced
- E-Mail Answers
Answer Posted / jimmyjj
// clean and simple
int maxDepth(Node *n) {
if (n == NULL) return 0;
int left = maxDepth(n->left);
int right = maxDepth(n->right);
return 1 + max(left, right);
}
| Is This Answer Correct ? | 8 Yes | 3 No |
Post New Answer View All Answers
To Write a C program to remove the repeated characters in the entered expression or in entered characters(i.e) removing duplicates. String contains only lowercase characters ['a'-'z']
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
Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange
write a program for area of circumference of shapes
What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?
Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines
How can you relate the function with the structure? Explain with an appropriate example.
What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql
Sir... please give some important coding questions asked by product companies..
write a c program to input initial & final time in the format hh:mm and find the time intervel between them? Ex inputs are initial 06:30 final 00:05 and 23:22 final 22.30
Hi, i have a project that the teacher want a pyramid of numbers in C# or java...when we click a button...the pyramid should be generated in a listbox/or JtextArea...and the pyramid should have the folowing form: 1 232 34543 4567654 567898765 67890109876 7890123210987 890123454321098 90123456765432109 0123456789876543210 Plz help with codes...didn't find anything on the net.
why nlogn is the lower limit of any sort algorithm?
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..
write a simple calculator c program to perform addition, subtraction, mul and div.
Write a Program in 'C' To Insert a Unique Number Only. (Hint: Just Like a Primary Key Numbers In Database.) Please Some One Suggest Me a Better Solution for This question ??
