Traverse a Linked List without recursion...
void display( struct llnode* ptr)
{
while( ptr!= NULL)
{
cout<< ptr->data;
ptr = ptr->link;
}
}
Traverse a Linked List using recursion...
void display( struct llnode* ptr)
{
if( ptr == NULL)
{
return;
}
else
{
cout<< ptr->data;
display( ptr->link);
}
}
Traverse from last a Linked List using recursion ( function calling ( n+2 times) )...
void display( struct llnode* ptr)
{
if( ptr == NULL)
{
return;
}
else
{
display( ptr->link);
cout<< ptr->data;
}
}
void display( struct llnode* ptr)
{
while( ptr!= NULL)
{
cout<< ptr->data;
ptr = ptr->link;
}
}
Traverse a Linked List using recursion...
void display( struct llnode* ptr)
{
if( ptr == NULL)
{
return;
}
else
{
cout<< ptr->data;
display( ptr->link);
}
}
Traverse from last a Linked List using recursion ( function calling ( n+2 times) )...
void display( struct llnode* ptr)
{
if( ptr == NULL)
{
return;
}
else
{
display( ptr->link);
cout<< ptr->data;
}
}
Traverse from last a Linked List using recursion ( function calling ( n+1 times) )...
void display( struct llnode* ptr)
{
if( ptr == NULL)
{
return;
}
else
{
if( ptr-> link = NULL)
{
display( ptr->link);
}
cout<< ptr->data;
}
}
