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 |
what is the purpose of the code, and is there any problem with it. bool f( uint n ) { return (n & (n-1)) == 0; }
find largest of 3 no
Find the O/p of the following 1) #include int main() { char c='1'; int j=atoi(c); }
what is the use of #pragma pack, wer it is used?
Between macros and functions,which is better to use and why?
do u print this format '(((())))'. This brackets is based on user input like 4 or 5 or 6,without using any loop's?
Write a program that takes a 5 digit number and calculates 2 power that number and prints it.
What is function in c with example?
Read N characters in to an array . Use functions to do all problems and pass the address of array to function. 2. Enter alphanumeric characters and form 2 array alphaets and digits.Also print the count of each array.
explain what is an endless loop?
How many types of errors are there in c language? Explain
How many data structures are there in c?