Q:

Java program to create a singly linked list of n nodes and display it in reverse order

belongs to collection: Java Singly Linked List Programs

robaa
Save to bookmark
|
2022-11-12
|
  229 
0

In this program, we need to create a singly linked list and display the list in reverse order.

Original List

Reversed List

One of the approaches to solving this problem is to reach the end the of the list and display the nodes from tail to head recursively.

Algorithm

  • Create a class Node which has two attributes: data and next. Next is a pointer to the next node in the list.
  • Create another class which has two attributes: head and tail.
  • addNode() will add a new node to the list:
    • Create a new node.
    • It first checks, whether the head is equal to null which means the list is empty.
    • If the list is empty, both head and tail will point to the newly added node.
    • If the list is not empty, the new node will be added to end of the list such that tail's next will point to the newly added node. This new node will become the new tail of the list.

a. reverse() will reverse the order of the nodes present in the list.

  • This method checks whether node next to current is null which implies that, current is pointing to tail, then it will print the data of the tail node.
  • Recursively call reverse() by considering node next to current node and prints out all the nodes in reverse order starting from the tail.

a. display() will display the nodes present in the list:

  • Define a node current which will initially point to the head of the list.
  • Traverse through the list till current points to null.
  • Display each node by making current to point to node next to it in each iteration.
Java programming, examples, Java programming examples,
login and add your own answer to this question

All Answers

robaa
2022-11-12
need an explanation for this answer? contact us directly to get an explanation for this answer

Program:

public class ReverseList {  
    //Represent a node of the singly linked list  
    class Node{  
        int data;  
        Node next;  
  
        public Node(int data) {  
            this.data = data;  
            this.next = null;  
        }  
    }  
  
    //Represent the head and tail of the singly linked list  
    public Node head = null;  
    public Node tail = null;  
  
    //addNode() will add a new node to the list  
    public void addNode(int data) {  
        //Create a new node  
        Node newNode = new Node(data);  
  
        //Checks if the list is empty  
        if(head == null) {  
            //If list is empty, both head and tail will point to new node  
            head = newNode;  
            tail = newNode;  
        }  
        else {  
            //newNode will be added after tail such that tail's next will point to newNode  
            tail.next = newNode;  
            //newNode will become new tail of the list  
            tail = newNode;  
        }  
    }  
  
    //reverse() will help the reverse the order of the list  
    public void reverse(Node current) {  
        //Checks if list is empty  
        if(head == null) {  
            System.out.println("List is empty");  
            return;  
        }  
        else {  
            //Checks if the next node is null, if yes then prints it.  
            if(current.next == null) {  
                System.out.print(current.data + " ");  
                return;  
            }  
            //Recursively calls the reverse function  
            reverse(current.next);  
            System.out.print(current.data + " ");  
        }  
    }  
  
    //display() will display all the nodes present in the list  
    public void display() {  
        //Node current will point to head  
        Node current = head;  
  
        if(head == null) {  
            System.out.println("List is empty");  
            return;  
        }  
  
        while(current != null) {  
            //Prints each node by incrementing pointer  
            System.out.print(current.data + " ");  
            current = current.next;  
        }  
        System.out.println();  
    }  
  
    public static void main(String[] args) {  
  
        ReverseList sList = new ReverseList();  
  
        //Add nodes to the list  
        sList.addNode(1);  
        sList.addNode(2);  
        sList.addNode(3);  
        sList.addNode(4);  
  
        System.out.println("Original List: ");  
        sList.display();  
  
        System.out.println("Reversed List: ");  
        //Print reversed list  
        sList.reverse(sList.head);  
    }  
}

Output:

Original List: 
1 2 3 4 
Reversed List: 
4 3 2 1

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Java Singly Linked List Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Java program to delete a node from the beginning o... >>
<< Java program to create a singly linked list of n n...