Answer / atul kabra

Suppose we want to fint the inorder successor of N. Then
traverse one time right from N. And then traverse a left
subtree until u will get left pointer null node.

s=n->right;
while(s->left!=NULL)
s=s->left;

printf("\nInoder Successor is %d",s->info);

Answer / 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.

#define f(g,h) g##h main O int i=0 int var=100 ; print f ("%d"f(var,10));} what would be the output?

1 Answers   Wipro,

---

Which header file is essential for using strcmp function?

0 Answers  

---

Explain how can I pad a string to a known length?

0 Answers  

---

Do string constants represent numerical values?

0 Answers  

---

Why pointers are used?

0 Answers  

---

Reverse a string word by word??

9 Answers  

---

What is the use of a conditional inclusion statement in C?

0 Answers   Global Logic,

---

all c language question

0 Answers   Wipro,

---

write a c programs to do multiplication of two numbers with out using arithmatic operator ??????????

7 Answers   Infosys, TCS,

---

Can include files be nested? How many levels deep can include files be nested?

0 Answers   Aspire, Infogain,

---

What is a dynamic array in c?

0 Answers  

---

main() { int i = 1; int num[] = {1,2,3,4}; num[i] = i++; printf("%d", num[i]); } what will be the output? }

22 Answers   NDS, TCS,

---