[algogeeks] Re: trying to create a function

mmm awsome thanks a lot guys. your all super helpful :) --~--~-~--~~~---~--~~ 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

[algogeeks] Re: Binary Tree - Depth First Search

Thats correct.On 10/27/06, arun kumar manickan [EMAIL PROTECTED] wrote: DFS on a BST= it pre order traversal .. is this correct ? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to

[algogeeks] Re: isomorphism

Deepak manohar's solution is an elegant one. This is very clumsy and you have a bug too. On 10/27/06, sivaramakrishna kantharao [EMAIL PROTECTED] wrote: hi how abt the following one int IsIsomorphic(tree *temp1,tree *temp2){if(temp1==NULL temp2==NULL)return 1;else if(temp1!=NULL temp2!=NULL){