Hi,
Construct a BST where each node has 3 pointers instead of 2.
the structure is
struct node
{
int data;
struct node *left;
struct node *right;
struct node *inordersuccessor;
}
write a code to add nodes in a binary search tree . inordersuccessor
pointing to inorder successor.
Regards,
Aman.
--
AMAN AGARWAL
"Success is not final, Failure is not fatal: It is the courage to continue
that counts!"
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
