In this post, we will talk and learn about How to convert sorted LinkedList to a balanced binary search tree (BST). Here I will talk about a couple of approaches: The logic Used in this Program: In this approach first, we find the middle element of LinkedList and make it root and do it recursively.… Read More »
In this post, We will learn How to check if the LinkedList is palindrome or not in Java? Logic used in Program: First of all, We have to find middle element of linked list using slowReference and fastReference Afterward, we have to reverse the second part of LinkedList Finally, compare the first and second part… Read More »
In a couple of previous Posts, We already went through the Singly Linked List Problem statements: Implementing a Circular Singly Linked List in Java ? How to check whether a linked list has a loop/cycle in java ? In this post, We will learn How to find start a node of loop in Singly LinkedList… Read More »
In this post, We will learn a couple of ways to check if String is number in java? The First approach uses regular Expression [-+]?\\d*\\.?\\d+ to check whether input string represents number or not. The second approach uses method parseDouble(InputString) from Double class if the input String successfully parse into a number then input String is number… Read More »
In this post, We will learn about Implementation to reverse a Singly Linked List in Java? The logic used in this source code: To reverse Linked List first of all we have to traverse through the linked list from head to tail and reverse the link in each step like each node instead of pointing to… Read More »
In this post, We will learn How to implement a Circular Singly Linked List in Java? What Is Circular Linked List: Circular Linked List is a Special Kind of Linked list in which the last node again refers back to the previous node that’s why Linked List goes into an infinite loop; you can verify it… Read More »
In the previous three posts, We Learned How to remove/delete first and last Node from Singly Linked List. We also learned how to remove Linked list Node from a given position or Index. How to remove the last node from a Singly Linked List in Java How to remove the first node from a Singly… Read More »
In this post, We will learn How to remove the last node from a Singly Linked List in Java? Program Logic to Remove/Delete Last node from Singly Linked List: Node<T> lastNode = head; Node<T> previousToLastNode = null; while(lastNode.next != null) { previousToLastNode = lastNode; lastNode = lastNode.next; } previousToLastNode.next = null; Complete Source Code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 |
package com.kkjavatutorials.util; import java.util.NoSuchElementException; /** * How to remove last node from a Singly Linked List in Java ? * @author KK JavaTutorials */ public class LinkedList<T> { private Node<T> head; //This internal class represents Node in Linked List private static class Node<T>{ private T data; private Node<T> next; public Node(T data) { super(); this.data = data; this.next = null; } } /** * This method insert a Node in Linked List * @param data has to insert in the List */ public void insert(T data) { Node<T> newNode = new Node<T>(data); if(head == null) { head = newNode; }else { Node<T> currentNode = head; while (currentNode.next != null) { currentNode = currentNode.next; } currentNode.next = newNode; } } /** * Removes and returns the last element from this list. * @return the last element from this list * @throws NoSuchElementException if this list is empty */ public T removeLast() { if(head == null) { throw new NoSuchElementException("List is Empty!!"); } Node<T> lastNode = head; Node<T> previousToLastNode = null; while(lastNode.next != null) { previousToLastNode = lastNode; lastNode = lastNode.next; } previousToLastNode.next = null; return lastNode.data; } /** * Method which traverse Linked List and display all data. */ public void displayLinkedList() { Node<T> currentNode = head; while(currentNode!= null) { System.out.print(currentNode.data+" "); currentNode = currentNode.next; } } public static void main(String[] args) { LinkedList<Integer> linkedList = new LinkedList<>(); linkedList.insert(10); linkedList.insert(20); linkedList.insert(30); linkedList.insert(40); linkedList.insert(50); linkedList.insert(60); System.out.println("Original LinkedList:"); linkedList.displayLinkedList(); System.out.println(); Integer removeLast = linkedList.removeLast(); System.out.println("After removing last Element:"+removeLast); linkedList.displayLinkedList(); } } |
Output Of… Read More »
In this post, We will learn How to remove the first node from a Singly Linked List in Java? Program Logic to Remove/Delete First node from Singly Linked List: If we want to remove the first node then we need to make the second node as head and delete memory allocated for the first node. Node<T> tempNode… Read More »
Design Patterns are very popular in IT Industry among software developers. Design Patterns are a well-proven common solution for generic problems provided by highly expert IT Engineers. Few of the common benefits of using design patterns are: Design Pattern can be used to develop reusable, more robust, and highly maintainable code so that We can… Read More »