{"id":26982,"date":"2017-12-28T22:01:04","date_gmt":"2017-12-28T16:31:04","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26982"},"modified":"2018-11-01T09:53:16","modified_gmt":"2018-11-01T04:23:16","slug":"python-programming-write-function-get-nth-node-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-programming-write-function-get-nth-node-linked-list\/","title":{"rendered":"Write a function to get Nth node in Linked List"},"content":{"rendered":"

Write a function to get Nth node in a Linked List Program<\/strong><\/span><\/p>\n

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

Linked List:<\/span><\/h3>\n

A linked list is a sequence of data elements, which are connected together through links. Each data element contains a connection to another data element in form of a pointer<\/a>. Python<\/a> does not have linked lists in its standard library.<\/p>\n

Example:<\/strong><\/span><\/h3>\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><\/span><\/h3>\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
Python Programming for\u00a0Write a function to get Nth node in a Linked List<\/strong><\/span><\/span><\/span><\/h3>\n
 
 Python<\/span> <\/div> 
# A complete working Python program to find n'th node# in a linked list # Node classclass Node:    # Function to initialise the node object    def __init__(self, data):        self.data = data # Assign data        self.next = None # Initialize next as null  # Linked List class contains a Node objectclass LinkedList:     # Function to initialize head    def __init__(self):        self.head = None      # This function is in LinkedList class. It inserts    # a new node at the beginning of Linked List.    def push(self, new_data):         # 1 & 2: Allocate the Node &        #     Put in the data        new_node = Node(new_data)         # 3. Make next of new Node as head        new_node.next = self.head         # 4. Move the head to point to new Node        self.head = new_node     # Returns data at given index in linked list    def getNth(self, index):        current = self.head # Initialise temp        count = 0 # Index of current node         # Loop while end of linked list is not reached        while (current):            if (count == index):                return current.data            count += 1            current = current.next         # if we get to this line, the caller was asking        # for a non-existent element so we assert fail        assert(false)        return 0; # Code execution starts hereif __name__=='__main__':     llist = LinkedList()     # Use push() to construct below list    # 1->12->1->4->1    llist.push(1);    llist.push(4);    llist.push(1);    llist.push(12);    llist.push(1);     n = 3    print 'Element at index 3 is :', llist.getNth(n)<\/code><\/pre> <\/div>\n
Output:<\/strong><\/span><\/h3>\n
Element at index 3 is 4<\/pre>\n
Time Complexity:<\/strong><\/span> O(n)<\/strong><\/p>\n[ad type=”banner”]\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Python 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 <\/p>\n","protected":false},"author":1,"featured_media":31263,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,4148,79478],"tags":[80286,80499,80490,80492,80489,80493,80495,80498,79571,80488,80491,80288,80494,80497,80285,80496],"class_list":["post-26982","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-linked-list","category-python","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\/26982","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=26982"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26982\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31263"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26982"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26982"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26982"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}