what is the height of tree if leaf node is at level 3. please
explain
Answer / Pramod Kumar Kanoujiya
The height of a binary tree can be calculated by counting the maximum number of edges from the root to any leaf node. Since a leaf node has no children, and you mentioned that the leaf node is at level 3, the tree must have a maximum of 2 levels above the leaf node (including the root) and 1 level below it.nThe height of this tree would be 3.
| Is This Answer Correct ? | 0 Yes | 0 No |
what does " calloc" do?
int a=2,b=3,c=4; printf("a=%d,b=%d\n",a,b,c); what is the o/p?
What is property type c?
main() { char p[] = "hello world!"; p = "vector"; printf("%s",p); }
2 Answers Vector, Vector India,
If null and 0 are equivalent as null pointer constants, which should I use?
When should the const modifier be used?
can you explain in brief what is "r+" mode in a file... i know that it si used to read and modify rhe existing content.... but explalanation about the file pointer in "r+" mode i wann to know???????????
How does free() know explain how much memory to release?
What are types of structure?
Program will then find the largest of three numbers using nested if-else statements. User is prompted to enter three numbers. Program will find the largest number and display it on the screen. All three numbers entered by the user are also displayed. If user enters 21, 33, and 5, the output should be as follows: You entered: 21, 33 and 5. The largest number is 33.
a) Identify the following declarations. Ex. int i (integer variable) float a[l0](array of 10 real nos) int (*f())() void *f int (*f()) [] void *f int f[] [] [] char *(*f) () int (*f[]) [] float(*f) [] [] float **f int ******f
Which node is more powerful and can handle local information processing or graphics processing?