Java program to find the maximum and minimum value node from a circular linked list

by Online Tutorials Library July 22, 2022

Java program to find the maximum and minimum value node from a circular linked list

In this program, we will create a circular linked list then, iterate through the list to find out the minimum and maximum node.

We will maintain two variables min and max. Min will hold the minimum value node, and max will hold the maximum value node. In above example, 2 will be the minimum value node and 9 will be the maximum value node.

Algorithm

Define a Node class which represents a node in the list. It has two properties data and next which will point to the next node.
Define another class for creating the circular linked list and it has two nodes: head and tail.
minNode() will print out minimum value node:
- Define variable min and initialize with head’s data.
- Current will point to head.
- Iterate through the list by comparing each node’s data with min.
- If min > current’s data then min will hold current’s data.
- At the end of the list, variable min will hold the minimum value node.
- Print the min value.

a. maxNode() will prints out maximum value node:

Define variable max and initialize with head’s data.
Current will point to head.
Iterate through the list by comparing each node’s data with max.
If max > current’s data then max will hold current’s data.
At the end of the list, variable max will hold the maximum value node.
Print the max value.

Program:

  public class MinMax {      //Represents the node of list.      public class Node{          int data;          Node next;          public Node(int data) {              this.data = data;          }      }        //Declaring head and tail pointer as null.      public Node head = null;      public Node tail = null;        //This function will add the new node at the end of the list.      public void add(int data){          //Create new node          Node newNode = new Node(data);          //Checks if the list is empty.          if(head == null) {               //If list is empty, both head and tail would point to new node.              head = newNode;              tail = newNode;              newNode.next = head;          }          else {              //tail will point to new node.              tail.next = newNode;              //New node will become new tail.              tail = newNode;              //Since, it is circular linked list tail will points to head.              tail.next = head;          }      }        //Finds out the minimum value node in the list      public void minNode() {          Node current = head;          //Initializing min to initial node data          int min = head.data;          if(head == null) {              System.out.println(“List is empty”);          }          else {               do{                   //If current node’s data is smaller than min                   //Then replace value of min with current node’s data                   if(min > current.data) {                       min = current.data;                   }                   current= current.next;              }while(current != head);                System.out.println(“Minimum value node in the list: “+ min);          }      }        //Finds out the maximum value node in the list      public void maxNode() {          Node current = head;          //Initializing max to initial node data          int max = head.data;          if(head == null) {              System.out.println(“List is empty”);          }          else {               do{                   //If current node’s data is greater than max                   //Then replace value of max with current node’s data                   if(max < current.data) {                       max = current.data;                   }                   current= current.next;                  }while(current != head);                System.out.println(“Maximum value node in the list: “+ max);          }      }        public static void main(String[] args) {          MinMax cl = new MinMax();          //Adds data to the list          cl.add(5);          cl.add(20);          cl.add(10);          cl.add(1);          //Prints the minimum value node in the list          cl.minNode();          //Prints the maximum value node in the list          cl.maxNode();      }  }  

Output:

Minimum value node in the list: 1  Maximum value node in the list: 20

Next TopicJava Programs

Java program to find the maximum and minimum value node from a circular linked list

Java program to find the maximum and minimum value node from a circular linked list

Algorithm

Program:

Java Program to count the total number of vowels and consonants in a string

Java program to print the following pattern on the console 4

You may also like