using two stacks or using a queue and a stack ... these are obvious
solutions ..
Just want to know if there exists an iterative way without extra space !!!
I should've mentioned these details earlier .. sorry for that !!
~raju
On Tue, Sep 27, 2011 at 10:09 PM, geeks wrote:
> just use the two
use one Queue instead of stacks.
this was one of amazon written question for me
Sini
On Tue, Sep 27, 2011 at 10:09 PM, geeks wrote:
> just use the two stacks here and do the level order traversal in spiral
> order and keep down prev pointer each time and just maintain the doubly
> linked i thin
just use the two stacks here and do the level order traversal in spiral
order and keep down prev pointer each time and just maintain the doubly
linked i think it is pretty gud hint :)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view
