{"id":26979,"date":"2017-12-28T21:54:34","date_gmt":"2017-12-28T16:24:34","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26979"},"modified":"2017-12-28T21:54:34","modified_gmt":"2017-12-28T16:24:34","slug":"write-function-get-nth-node-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/write-function-get-nth-node-linked-list\/","title":{"rendered":"C Programming – Write a function to get Nth node in a Linked List"},"content":{"rendered":"

Write a GetNth() function that takes a linked list and an integer index and returns the data value stored in the node at that index position.
\n<\/span><\/p>\n

Example:<\/strong><\/p>\n

Input:  1->10->30->14,  index = 2\r\nOutput: 30  \r\nThe node at index 2 is 30\r\n<\/pre>\n
\n
Algorithm:<\/strong><\/p>\n
1. Initialize count = 0\r\n2. Loop through the link list\r\n     a. if count is equal to the passed index then return current\r\n         node\r\n     b. Increment count\r\n     c. change current to point to next of the current.\r\n<\/pre>\n[ad type=”banner”]\n
C Programming:<\/p>\n
 
 <\/div> 
\/\/ C program to find n'th node in linked list#include <stdio.h>#include <stdlib.h>#include <assert.h> \/* Link list node *\/struct node{    int data;    struct node* next;}; \/* Given a reference (pointer to pointer) to the head    of a list and an int, push a new node on the front    of the list. *\/void push(struct node** head_ref, int new_data){    \/* allocate node *\/    struct node* new_node =            (struct node*) malloc(sizeof(struct node));     \/* put in the data  *\/    new_node->data  = new_data;       \/* link the old list off the new node *\/    new_node->next = (*head_ref);       \/* move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Takes head pointer of the linked list and index    as arguments and return data at index*\/int GetNth(struct node* head, int index){    struct node* current = head;    int count = 0; \/* the index of the node we're currently                  looking at *\/    while (current != NULL)    {       if (count == index)          return(current->data);       count++;       current = current->next;    }       \/* if we get to this line, the caller was asking       for a non-existent element so we assert fail *\/    assert(0);              } \/* Drier program to test above function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;       \/* Use push() to construct below list     1->12->1->4->1  *\/    push(&head, 1);    push(&head, 4);    push(&head, 1);    push(&head, 12);    push(&head, 1);         \/* Check the count function *\/    printf("Element at index 3 is %d", GetNth(head, 3));      getchar();}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Element at index 3 is 4<\/pre>\n
Time Complexity:<\/strong> O(n)<\/p>\n[ad type=”banner”]\n<\/div>\n","protected":false},"excerpt":{"rendered":"
C Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer index<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,79478],"tags":[80286,80499,80490,80492,80489,80493,80495,80498,79571,80488,80491,80288,80494,80497,80285,80496],"class_list":["post-26979","post","type-post","status-publish","format-standard","hentry","category-linked-list","category-singly-linked-list","tag-algorithm-to-search-an-element-in-singly-linked-list","tag-c-program-to-search-for-an-element-in-the-linked-list-using-recursion","tag-delete-nth-element-in-linked-list","tag-find-middle-element-in-linked-list-java","tag-find-nth-element-in-linked-list-c","tag-find-nth-to-last-element-in-a-linked-list-recursion","tag-insert-a-node-at-a-specific-position-in-a-linked-list-c","tag-linear-search-using-linked-list-in-c","tag-linked-list-search-java","tag-nth-node-from-the-end-of-a-linked-list-java","tag-search-a-node-in-linked-list-in-c","tag-search-an-element-in-doubly-linked-list","tag-search-node-in-linked-list-c","tag-searching-a-linked-list-in-data-structure","tag-searching-in-linked-list-algorithm","tag-searching-in-linked-list-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26979","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26979"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26979\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26979"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26979"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26979"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}