From: Terje Slettebø (tslettebo_at_[hidden])
Date: 2002-10-11 08:27:37
>From: "Terje Slettebø" <tslettebo_at_[hidden]>
> >From: "Larry Evans" <jcampbell3_at_[hidden]>
> >Also, couldn't a stack<node*> be used instead of the node* parent to
> >traverse the list; thereby saving one node*? Again, a space/time
> I'm not sure what you mean, here, could you elaborate?
Opps. I'm not used to traverse trees iteratively, so I didn't think of that
you may need a parent pointer in that case (as tree.hh does). I understand
what you meant, now. Still, as mentioned, I think you also need it to avoid
traversing the tree when deleting the first child of a node.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk