2. can this be done in the following manner ? print the preorder and inorder traversal of the tree and then you can build it back but for binary trees....
On Tue, Jan 11, 2011 at 1:12 PM, juver++ <[email protected]> wrote: > 1. Any shortest path algorithms on graphs (Dijkstra, Bellman-Ford, Floyd). > 2. Store it's edges while doing DFS. > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
