Skip to main content

How to Create Custom Linked List Class, Insert Values and Print it in Java

Implementing a Custom Linked List Class from Scratch in Java

Implementing a Custom Linked List Class from Scratch in Java
 

In this article, we will seen

  • How to create Node Class

  • Create Insert method and Add data in Custom Linked list Class

  • Print All elements of Linked list

Linked list is linear data structure, means it stores values in linear manner but like Arrays it does not store elements at contiguous location.

Linked list class represent as node and node contains value and reference of next and previous node.

You can learn about Linked list class in details :

List interface and Linked list class 

Lets start with creating singly custom linked list class.

Step 1 : Create Node class

class Node {
    
    //Data in the current node
    int value;
    //Reference for the next node
    Node next;

    Node(int value) {
        this.value = value;
    }
}

Step 2 : Create Custom Linked list class, Add insert() and printList() methods

class CustomLinkedList {
    
    Node head;

    public void insert(int value) {
        Node newNode = new Node(value);
        
        if (head == null) {
            head = newNode;
        } else {
            Node node = head;
            while(node.next != null) {
                node = node.next;
            }
            node.next = newNode;
        }
    }

    public static void printList(CustomLinkedList list) {
        
        Node currNode = list.head;
    
        // Traverse through the LinkedList
        while (currNode != null) {
            // Print the data at current node
            System.out.print(currNode.value + " ");
    
            // Go to next node
            currNode = currNode.next;
        }
    }
}

Step 3 : Create Main class and Call CustomeLinkedList class insert() and printList() method

import java.util.Scanner;

public class Example {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Size of LinkedList");
        int size = sc.nextInt();
       
        System.out.println("Enter Data in LinkedList");
       
        // Creating CustomLinkedList object and storing Node
        CustomLinkedList obj = new CustomLinkedList();
        for (int i = 0; i < size; i++) {
             obj.insert(sc.nextInt());
        }
 
        // Print Linked list elements
        obj.printList(list);
    }

}

Output :

Enter Size of LinkedList
6
Enter Data in LinkedList
1 2 3 6 5 4

1 2 3 6 5 4
________________________

Enter Size of LinkedList
10
Enter Data in LinkedList
10 2 30 60 8 55 9 66 94 25

10 2 30 60 8 55 9 66 94 25 


RECOMMENDED ARTICLES :


Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last