Store any two traversals (inorder must) and reconstruct it later. Total space 2n (n = number of nodes)
On Aug 28, 11:29 am, rohit <[email protected]> wrote: > How to save a binary search tree space efficiently and built it > again , just tell any idea. -- 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.
