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 this same binary Tree has be to mirrored to
another desktop?

*My Approach:*
1. Traverse the binary tree and store the elements in an array. Transfer the
same to another process present on another desktop through socket
communication. But in this case how do i construct the same binary tree at
the other end? Do i read in one of the in-order/post-order/pre-order and do
it the same way at the other end?
2. Does this involve Virtualization concept?

Regards,
Vikas J

-- 
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 group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to