Skip to main content

Search for a node in Linked List

Normally searching can be done using linear search or binary search. But in a linked list, jumping to an intermediate node is not possible. Hence searching should be done sequentially.

Let us assume we have a linked list of names.

struct node
{
   char name[30];
   struct node * next_ptr;
};
typedef struct node * NODEPTR;


In fact it would be better optimized, if we use a dynamic memory for name. For sake of simplicity, let us leave that. Now we have a node pointer called head, which points to the head of the list. And we also have a string search_string. We need to write a function to search this string, and return the pointer to node containing this string. If search string is not found, we must return NULL. 

NODEPTR head;
-----
-----
NODEPTR search(NODEPTR head, char *str)
{
      NODEPTR temp;
      for(temp=head;temp!=NULL;temp = temp->next_ptr)
      {
             if(strcmp(temp->name,str)==0)
                  return temp;
      }
      return NULL;
}
We start from first node and compare each node till we find the node containing str. But we should not forget to check for end of list, indicated by NULL.

One step where we may go wrong is comparing temp->name with str instead of using strcmp. If we compare them, then the pointers of these two strings are compared, which will never be equal.

Two more ways of optimization are

  1. Not using temp at all. Instead head itself can be used for list traversal. We need not worry that list would get corrupted. It won't as head is a call by value parameter. 
  2. In for condition adding the clause temp->NULL && strcmp(temp->name,str). If strcmp returns 0, condition is false and loop will terminate. But in this case, the body of for loop will be just a semicolon (;). And return statement will be return temp. If we have reached end of list, then temp will be NULL, so we return NULL. 
You can download the complete program from here

Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

Deletion of a node from linked list given only that node

We have considered how to create and print the list and delete a node from a list. But often interviewers ask you a question, given a node of the list, how do you delete that node? The problem here is we do not know the head of the list. We just the know one node which we must delete. Well, the solution is much simpler than it appears. Suppose 12 is the node which should be deleted. As we can see from the diagram, we are deleting the next node of 99 by the usual method of linking n to next of next of 12. But the requirement was not to delete next node  but the node with 12 itself. So we will retain the data of that node (99) by copying it to previous node. And now the node with 99 is marked for deletion. Which can be easily deleted as follows. We are assuming that n is the node with 12 as value. n -> data = n -> next -> data; //copy the data n -> next = n -> next -> next; //link to next free( n -> next) ; //delete next of n   ...
Post a Comment
Read more