how to find out the inorder successor of a node in a tree??
Answers were Sorted based on User's Feedback
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);
| Is This Answer Correct ? | 27 Yes | 42 No |
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.
| Is This Answer Correct ? | 11 Yes | 27 No |
When should the register modifier be used? Does it really help?
What is the difference between exit() and _exit() function in c?
a.One Cannot Take the address of a Bit Field b.bit fields cannot be arrayed c.Bit-Fields are machine Dependant d.Bit-fields cannot be declared as static Which of the Following Statements are true w.r.t Bit-Fields A)a,b&c B)Only a & b C)Only c D)All
3 Answers Accenture, Digg.com,
What are the different data types in C?
what are the difference between ANSI C and Let Us c and Turbo C
whitch value return void main?
What is modifier & how many types of modifiers available in c?
How to draw the flowchart for structure programs?
A character flag or control mechanism that delineates one data item from another a) variable b) constant c) delimiter d) call by reference
Why is struct padding needed?
What is structure packing ?
Explain about the constants which help in debugging?