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

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...