Given the in-order and pre-order traversals, can anyone think of a linear time re-construction of the binary tree? The brute force method is O(n^2).
-- 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.
