Answer Posted / shruti

inorder trraversal is
left - vertex - right.

hence to find the successor of a node.

consider N node . we have to find the inorder successor of
N.
then,

if(n -> right != NULL)
n = n -> right. /* this is the successor of n.
else
{
n = pop();
(/* we have to pop the address of the node above n, which
we have pushed earlier while traversing leftwards*/)
/*n will be hte successor node.
}


in inorder traversal we have number in ascending order in a
binary search tree.
hence the successor always is to the right, if exists,
or one level above.

**Go through the inorder traversal program to get a better
picture.

What is the condition that is applied with ?: Operator?

1120

---

#include main() { int *p, *c, i; i = 5; p = (int*) (malloc(sizeof(i))); printf(" %d",*p); *p = 10; printf(" %d %d",i,*p); c = (int*) calloc(2); printf(" %d ",*c); }

1039

---

What is the difference between array and structure in c?

1146

---

Write a C/C++ program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the maximum number of concurrent threads that the InnoDB plug-in can create.

1928

---

Place the #include statement must be written in the program?

1020

---

Write a code to determine the total number of stops an elevator would take to serve N number of people.

1248

---

What is indirection? How many levels of pointers can you have?

1117

---

Explain how can you restore a redirected standard stream?

1086

---

What is advantage of pointer in c?

1172

---

What is the size of a union variable?

1044

---

write a program in C that prompts the user for today's date,tomorrow's date and display the results.Use structures for today's date,tomorrow's date and an array to hold the days for each month of the year.

5446

---

Explain the bubble sort algorithm.

1044

---

Explain what does the characters 'r' and 'w' mean when writing programs that will make use of files?

1240

---

What is the basic structure of c?

1065

---

Explain heap and queue.

1067

---