{"id":27620,"date":"2018-04-09T20:10:08","date_gmt":"2018-04-09T14:40:08","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27620"},"modified":"2018-09-16T13:29:50","modified_gmt":"2018-09-16T07:59:50","slug":"java-algorithm-move-last-element-front-given-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-algorithm-move-last-element-front-given-linked-list\/","title":{"rendered":"Java Algorithm – Move last element to front of a given Linked List"},"content":{"rendered":"

Write a C function that moves last element to front in a given Singly Linked List. For example, if the given Linked List is 1->2->3->4->5, then the function should change the list to 5->1->2->3->4.<\/span><\/p>\n

Algorithm:
\nTraverse the list till last node. Use two pointers: one to store the address of last node and other for address of second last node. After the end of loop do following operations.
\ni) Make second last as last (secLast->next = NULL).
\nii) Set next of last as head (last->next = *head_ref).
\niii) Make last as head ( *head_ref = last)<\/p>\n

Java Programming:<\/strong><\/p>\n

<\/div> 
\/* Java Program to move last element to front in a given linked list *\/class LinkedList{    Node head;  \/\/ head of list      \/* Linked list Node*\/    class Node    {        int data;        Node next;        Node(int d) {data = d; next = null; }    }     void moveToFront()    {        \/* If linked list is empty or it contains only           one node then simply return. *\/           if(head == null || head.next == null)               return;         \/* Initialize second last and last pointers *\/        Node secLast = null;        Node last = head;         \/* After this loop secLast contains address of            second last  node and last contains address of            last node in Linked List *\/        while (last.next != null)          {           secLast = last;           last = last.next;         }         \/* Set the next of second last as null *\/        secLast.next = null;         \/* Set the next of last as head *\/        last.next = head;         \/* Change head to point to last node. *\/        head = last;    }                                           \/* Utility functions *\/     \/* Inserts a new Node at front of the list. *\/    public void push(int new_data)    {        \/* 1 & 2: Allocate the Node &                  Put in the data*\/        Node new_node = new Node(new_data);          \/* 3. Make next of new Node as head *\/        new_node.next = head;          \/* 4. Move the head to point to new Node *\/        head = new_node;    }     \/* Function to print linked list *\/    void printList()    {        Node temp = head;        while(temp != null)        {           System.out.print(temp.data+" ");           temp = temp.next;        }          System.out.println();    }      \/* Drier program to test above functions *\/    public static void main(String args[])    {        LinkedList llist = new LinkedList();        \/* Constructed Linked List is 1->2->3->4->5->null *\/        llist.push(5);        llist.push(4);        llist.push(3);        llist.push(2);        llist.push(1);                 System.out.println("Linked List before moving last to front ");        llist.printList();                 llist.moveToFront();                 System.out.println("Linked List after moving last to front ");        llist.printList();    }} \/* This code is contributed by Rajat Mishra *\/<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
 Linked list before moving last to front \r\n1 2 3 4 5 \r\n Linked list after removing last to front \r\n5 1 2 3<\/pre>\n
Time Complexity: O(n) where n is the number of nodes in the given Linked List.<\/p>\n","protected":false},"excerpt":{"rendered":"
Python Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly<\/p>\n","protected":false},"author":1,"featured_media":31286,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,79478],"tags":[81917,81924,81919,81920,81922,81925,81918,81586,81923,81921],"class_list":["post-27620","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-linked-list","category-singly-linked-list","tag-java-linked-list-move-element-to-front","tag-java-list-move-element-to-another-position","tag-move-last-element-to-front-of-a-given-linked-list-java","tag-move-node-from-one-linked-list-to-another","tag-move-to-front-java","tag-sorted-vector","tag-swap-every-two-nodes-in-a-linked-list","tag-swapping-two-nodes-in-a-singly-linked-list","tag-unsorted-linked-list","tag-write-a-method-to-add-two-polynomial-equations-using-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27620","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=27620"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27620\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31286"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27620"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27620"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27620"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}