You can search in internet itself for STL books and online material. There
you will find many examples.
Regards
Phani
On 9/13/07, Abhishek <[EMAIL PROTECTED]> wrote:
>
> Can you plz elaborate your question.
>
>
>
> On 9/12/07, mirchi <[EMAIL PROTECTED]> wrote:
> >
> >
> > can someone please tell
Regards,
> > > > K.V.Chandra Kumar.
> > > >
> > > > On 28/08/07, MD <[EMAIL PROTECTED] > wrote:
> > > >
> > > >
> > > >
> > > > > I think first s=pop() in while is not the right approach. This is
>
Hi all,
Please let me know if this pseudo code gives correct solution for iterative
post-order traversal of a binary tree.
void postOrderTraversal(Tree *root)
{
node * previous = null;
node * s = null;
push(root);
while( stack is not empty )
{
Hi all,
Please let me know if this pseudo code solution is correct for iterative
post-order traversal of a binary tree.
void postOrderTraversal(Tree *root)
{
node * previous = null;
node * s = null;
push(root);
while( stack is not empty )
{
s
