Binary tree traversing
Answer / qint
void Traverse(Node *t)
{
if(NULL == t)
return;
//in-order traversing
Traverse(t->left);
printf("%d",t->data);
Traverse(t->right);
//pre-order
printf("%d",t->data);
Traverse(t->left);
Traverse(t->right);
//post order
Traverse(t->left);
Traverse(t->right);
printf("%d",t->data);
}
| Is This Answer Correct ? | 13 Yes | 0 No |
Draw a flowchart to produce a printed list of all the students over the age of 20 in a class .The input records contains the name and age of students. Assume a sentinel value of 99 for the age field of the trailer record
what will happen if you free a pointer twice after allocating memory dynamically ?
which of the following go out of the loopo if expn 2 becoming false a.while(expn 1){...if(expn 2)continue;} b.while(!expn 1){if(expn 2)continue;...} c.do{..if(expn 1)continue;..}while(expn 2); d.while(!expn 2){if(expn 1)continue;..}
"%u" unsigned integer print the a) address of variable b) value of variable c) name of a variable d) none of the above
What is the use of function in c?
Explain what is page thrashing?
What is pointer in c?
What are the different types of storage classes in C?
what is d pitfalls of registers variables
What is the difference between GETS();AND SCANF();
Explain the difference between call by value and call by reference in c language?
which type of question asked from c / c++ in interview.