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);
}

What is the process of writing the null pointer?

0 Answers  

---

What is the difference between variable declaration and variable definition in c?

0 Answers  

---

How can you find the exact size of a data type in c?

0 Answers  

---

Explain the binary height balanced tree?

0 Answers  

---

Find if a number is power of two or not?

1 Answers  

---

What are types of structure?

0 Answers  

---

What are dangling pointers? How are dangling pointers different from memory leaks?

1 Answers  

---

can we declare a function in side the structure?

2 Answers   HCL,

---

What is difference between union All statement and Union?

0 Answers  

---

What is strcmp in c?

0 Answers  

---

What is merge sort in c?

0 Answers  

---

what will be the output of this program? void main() { int a[]={5,10,15}; int i=0,num; num=a[++i] + ++i +(++i); printf("%d",num); }

6 Answers   Microsoft,

---