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 |
Explain the properties of union. What is the size of a union variable
what is the Output? int a=4 b=3; printf("%d%d%d%d%d%d",a++,++a,a++,a++,++a,a++); printf("%d%d%d%d%d%d",b--,b--,--b,b--,--b,--b);
Find if a number is power of two or not?
Subtract Two Number Without Using Subtraction Operator
Why is the code below functioning. According to me it MUST NOT.
How will you print TATA alone from TATA POWER using string copy and concate commands in C?
0 Answers Amdocs, Apps Associates,
Explain goto?
What are categories used for in c?
How many levels of pointers can you have?
Explain 'far' and 'near' pointers in c.
What is the purpose of the code, and is there any problem with it? unsigned int f( unsigned n ) { return –n & 7; }
What does char * * argv mean in c?