This C code will create a new mirror copy tree.
mynode *copy(mynode *root)
{
mynode *temp;
if(root==NULL)return(NULL);
temp = (mynode *) malloc(sizeof(mynode));
temp-value = root-value;
temp-left = copy(root-right);
temp-right = copy(root-left);
return(temp);
}
On 13 June 2010 17:07, BALARUKESH
what is a virtualization concept ???
I am a newbie regarding the Algo Analysis. I was asked this question
recently in an interview. Please let me know if anyone of you know how to
solve this.
*Question:*
Assume You have a binary Tree (not sorted and not BST) with a specific
pattern on a
try this one..
make a level order traversal and store the elements in array... on the other
system reconstruct it using right element for the left and left element for
the right...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
just send the inorder and preorder traversal of binary tree to other process
and recontruct it.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this
Good Evening to Algo_Geeks,
I am a newbie regarding the Algo Analysis. I was asked this question
recently in an interview. Please let me know if anyone of you know how to
solve this.
*Question:*
Assume You have a binary Tree (not sorted and not BST) with a specific
pattern on a Desktop1. How can