glegroups.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.
> >
>
> --
>
> You received this message
Given value you can easily find the key using hash function it self.-
Find2(v)
If we just have one hash table, that is enough to do the first two
operations. Insert & Find1
On 3/27/08, Sticker <[EMAIL PROTECTED]> wrote:
>
>
> I was interviewed a question about implementing a bi-direction
> has
Use inorder traversal without recursion.
On 2/11/08, James Fang <[EMAIL PROTECTED]> wrote:
>
>
> Use a queue, assume the root of the binary tree : pRoot;
> Below is the pseudo code:
>
> enQueue(pRoot);
> While( queue not empty )
> {
>pNode = outQueue();
>print(pNode);
>if(pNode->left)
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:
>
2 4 5 3 6 7
So, think if your solution works for the post order.
Regards
Phani
On 9/9/07, chandra kumar <[EMAIL PROTECTED]> wrote:
>
> HI,
> I think the following solution will solve the problem. It's not as
> elegant as the previous one but a straight forward
{ push(s->right); }
if(s->left) { push(s->left); }
}
}
}
---
Regards
Phani
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send e
}
if(s->left) { push(s->left); }
}
}
}
---
Regards
Phani
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send emai
Whats the solution which you got in O(n log n)?
--~--~-~--~~~---~--~~
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 from this group
