if(nodeptr) {
}
On Mon, Sep 5, 2011 at 5:29 PM, $hr! k@nth srithb...@gmail.com wrote:
Hi guyz,
*Given only a pointer to a node to be deleted in a singly linked list, how
do you delete it?*
if that node is in between the list, we can copy the data from next node
into this node and we
int main(void)
{
inf_times:
printf(Hello);
goto inf_times;
return 0;
}
On Fri, Mar 11, 2011 at 7:46 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
Hi
my question is without Loop and Recursion function using???
On Fri, Mar 11, 2011 at 5:40 AM, Abhishek Mallick
The only gurantee in this is that the outer printf result will come first.
Why ? because comma operator does not act as sequence point.
-Arun prasath N
On Sat, Jun 12, 2010 at 3:44 PM, divya jain sweetdivya@gmail.comwrote:
thanks to all for explanantions :)
On 12 June 2010 15:43, divya
The nature of the problem involves inserting some elements in heap and
retriving back ..It could be solved in worst case O(n * lg(n)).
Average case O(n) solution is not there I believe.
-Arun prasath N
On Fri, Apr 30, 2010 at 5:35 PM, divya sweetdivya@gmail.com wrote:
Given two sorted
This does not create a balanced tree but ensures that every element in the
tree is accessible by lg(n) time.
Time : Complexity O(n)
[a...@91blore-srv1 ~]$ cat recursion.c
#include stdlib.h
#includeunistd.h
#include stdio.h
#define TEST2
#ifdef TEST1
int arr[] = { 1,2,3,4,5,6,7};
int max_elems
144
On Tue, Jun 2, 2009 at 3:00 PM, Aminooo~ amin...@gmail.com wrote:
*Dear Friends,*
* *
*A question for the genius, the one who solve the problem will write the
name in the attached file.*
*IF; 2+3=10*
* 7+2=63*
* 6+5=66*
* 8+4=96*
*THEN;*
* 9+7=???*
Recursion based on the above 3 stmt won't work .
* how do we know the root in level i , where i belongs to
{0,1,...depth-1} .
It looks like a problem of isomorphism how do we check for it
without constructing a tree.
Arun prasath N
On Nov 3, 3:16 am, Arun [EMAIL PROTECTED] wrote:
i
