Comments for Encrypt3d http://encrypt3d.wordpress.com you have to just decrypt it ! Sat, 20 Jun 2009 14:46:54 +0000 http://wordpress.com/ hourly 1 Comment on Merging two sorted linked lists !! by vie90 http://encrypt3d.wordpress.com/2007/08/04/merging-two-sorted-linked-lists/#comment-287 vie90 Sat, 20 Jun 2009 14:46:54 +0000 http://encrypt3d.wordpress.com/2007/08/04/merging-two-sorted-linked-lists/#comment-287 thanks for all thanks for all

]]> Comment on Height of the binary tree! by Sagar Rohankar http://encrypt3d.wordpress.com/2007/06/14/height-of-the-binary-tree/#comment-285 Sagar Rohankar Tue, 03 Mar 2009 16:01:32 +0000 http://encrypt3d.wordpress.com/2007/06/14/height-of-the-binary-tree/#comment-285 Don't you think we need an increment by one each time we return from stack call, like if(p->left){h1=height(p->left) + 1; // increment Don’t you think we need an increment by one each time we return from stack call, like

if(p->left){h1=height(p->left) + 1; // increment

]]> Comment on Merging two sorted linked lists !! by Alexwebmaster http://encrypt3d.wordpress.com/2007/08/04/merging-two-sorted-linked-lists/#comment-284 Alexwebmaster Tue, 03 Mar 2009 11:05:49 +0000 http://encrypt3d.wordpress.com/2007/08/04/merging-two-sorted-linked-lists/#comment-284 Hello webmaster I would like to share with you a link to your site write me here preonrelt@mail.ru Hello webmaster
I would like to share with you a link to your site
write me here preonrelt@mail.ru

]]> Comment on Easy one! by MApps http://encrypt3d.wordpress.com/2007/06/12/easy-one/#comment-283 MApps Tue, 17 Feb 2009 07:03:48 +0000 http://encrypt3d.wordpress.com/2007/06/12/easy-one/#comment-283 See the formula for this. <a href="http://mapps.wordpress.com/2009/02/17/clockwise-angle/" rel="nofollow">SMART SOLUTIONS</a> See the formula for this.
SMART SOLUTIONS

]]> Comment on Kopete and Latex by BAReFOOt http://encrypt3d.wordpress.com/2007/08/04/kopete-and-latex/#comment-281 BAReFOOt Wed, 21 Jan 2009 05:22:39 +0000 http://encrypt3d.wordpress.com/2007/08/04/kopete-and-latex/#comment-281 Does this work with other messengers too? Does this work with other messengers too?

]]> Comment on Threaded binary Trees !! by Piendycreemem http://encrypt3d.wordpress.com/2007/08/05/threaded-binary-trees/#comment-279 Piendycreemem Sun, 03 Aug 2008 04:11:34 +0000 http://encrypt3d.wordpress.com/2007/08/05/threaded-binary-trees/#comment-279 I agreed with you I agreed with you

]]> Comment on Find the cycle in a linked list, if any? by encrypt3d http://encrypt3d.wordpress.com/2007/06/11/find-the-cycle-in-a-linked-list-if-any/#comment-46 encrypt3d Wed, 18 Jul 2007 21:16:53 +0000 http://encrypt3d.wordpress.com/2007/06/11/find-the-cycle-in-a-linked-list-if-any/#comment-46 if the two pointers doesn't meet, then there is no loop !! if the two pointers doesn’t meet, then there is no loop !!

]]> Comment on Find the cycle in a linked list, if any? by priyanka samanta http://encrypt3d.wordpress.com/2007/06/11/find-the-cycle-in-a-linked-list-if-any/#comment-6 priyanka samanta Tue, 03 Jul 2007 08:15:39 +0000 http://encrypt3d.wordpress.com/2007/06/11/find-the-cycle-in-a-linked-list-if-any/#comment-6 give the optimised answer.If two pointers doesn't meet whaty will happen? how we will find the loop? give the optimised answer.If two pointers doesn’t meet whaty will happen?
how we will find the loop?

]]> Comment on Compare two linked lists ! by encrypt3d http://encrypt3d.wordpress.com/2007/06/13/compare-two-linked-lists/#comment-3 encrypt3d Thu, 21 Jun 2007 17:43:24 +0000 http://encrypt3d.wordpress.com/2007/06/13/compare-two-linked-lists/#comment-3 for circular list, the condition for the end of the list will change. bool compare(struct node *p1, struct node *p2) { if(p1->link == p1 && p2->link ==p2) return true; else if(p1->link ==p1 || p2->link ==p2) return false; else compare(p1->link,p2->link); } for circular list, the condition for the end of the list will change.

bool compare(struct node *p1, struct node *p2)

{ if(p1->link == p1 && p2->link ==p2)
return true;
else if(p1->link ==p1 || p2->link ==p2)
return false;
else
compare(p1->link,p2->link);
}

]]> Comment on Compare two linked lists ! by Jackie http://encrypt3d.wordpress.com/2007/06/13/compare-two-linked-lists/#comment-2 Jackie Thu, 21 Jun 2007 14:47:08 +0000 http://encrypt3d.wordpress.com/2007/06/13/compare-two-linked-lists/#comment-2 How would you do this for a circularly linked lists? How would you do this for a circularly linked lists?

]]>