in the gopinath solution we need to maintain another array and it contains the maximum bst constructed so far... when len is updated this array also updated to contain the present queue values...
On Aug 15, 11:57 am, Ankit Singh <ankitatit...@gmail.com> wrote: > Space complexity- O(n), Time - O(n2). -- 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.
