Hello
I am creating a birthday calendar for myself. Can you please click on the link
below and enter your birthday for me?
http://www.birthdayalarm.com/bd2/84309849a540390710b1451932838c208608719d1386
Eswar
--~--~-~--~~~---~--~~
You received this message beca
void MyTree::TraversePostorder( void (*pfnVisit)(void *) )
{
NODE *p = m_proot;
NODE *upfromthisnode = NULL;
m_pstack->clear();
while( p ) {
if( upfromthisnode ) {
// we just popped up from a lower node.
you will use stack, and you have 2 kind of values in stack, one is visit
node first time, and second is wisit node for second time
when first time: you put visit this node for second time and then you put
visit nododes for first time to stack for all descendands
when second time: you calculate
recursion uses stack rite .implement the recusrion by using the satck
On Sun, Jan 18, 2009 at 4:54 PM, algorithm wrote:
>
> how to solve post - order traversal without using recursion ?
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you are subsc
how to solve post - order traversal without using recursion ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe fr
