Skip to main content

LinkedList Creation and Traversal | Java | MyCodingNetwork

How to Create and Traverse a Linked List without using Java collection frameworks?

Linked lists are an essential data structure in computer science, providing an efficient way to store and manage data. In Java, the LinkedList class in the Java Collections framework is widely used for this purpose. However, in this blog post, we will explore how to create a LinkedList from scratch using a custom class, without relying on the built-in Java Collections.

 

Algorithm:

1.            Define a Node class that represents individual nodes in the list. Each node contains data and a reference to the next node in the sequence.

2.            To add elements to the LinkedList, we will create an object of the Node class and assign a value of the node to its constructor. Its syntax is: Node newNode = new Node(value);

3.            To traverse the LinkedList, we'll create a traverse( ) function start from the head node and keep moving to the next node until we reach the end (i.e., the next node is null).

Source Code:

 


Output:

 


Theory:

In the above code, there are two classes Node and LL are created.

1.            Node class contains two instance variables, next and data. The ‘data’ variable stores the value of a node and the next variable is used to store a reference to the next node.

2.            LL class contains a main( ) function which has been used to create a linked list of three nodes, (namely, node1, node2 and node3). These nodes are linked together using the next field. The head variable is assigned with the first node, here, node1. Now, the traverse() function can then be called by passing the head of the node as the formal parameter.

3.            The traverse() method starts by initializing the cur variable with the head of the node. It then enters into a while loop which terminates when current reaches null. Inside the loop, we have a print statement, for printing the value that is data of the current node, that is, cur. After this, the cur variable is updated to the next node of the linked list. This process continues till the loop reaches its termination. Thus, we get the output.

Video reference:



Hope you liked this explanation, for any feedback or doubt you can comment down in the comment section.

 

Popular posts from this blog

Pattern 2 | Java

  Problem Statement: Write a program to draw the following pattern: * * * * * * * * * * * * * * * (take a variable n which decides the number of rows, for above example, n=5) THE CODE Output: *  * *  * * *  * * * *  * * * * *  * * * * * *          * * * * * * *        * * * * * * * *      * * * * * * * * *    * * * * * * * * * * Simplification : In the above problem, the value of n is 10 (i.e., the number of rows are 10) 1. In the first for loop we have i as the counter variable with initial value of 1 and having a condition i.e. i should be less than or equal to n.  It has a print statement after the second for loop,  System.out.println(); w hich is used for changing the row, each time for the second for loop terminates. 2. In the second for loop we have j as the counter variable with initial value of 1 having a condition i.e. j  should be  less than or equal to i (the value of i  will be as per the current ongoing iteration). Further it has an updation statement j++  Inside the seco

Code #1 | Hello Java | Basics of Java

Today starting with a very basic coding program in Java. So, the program is Write a program in Java to print "Hello Java!" Output: Hello Java!

Bubble Sort | Java & Python | MyCodingNetwork | Alok Tripathi

  Bubble Sort is a simple sorting algorithm that works by repeatedly comparing and swapping adjacent elements in an array until they are in the correct order. It is called bubble sort because the smaller elements "bubble" to the top of the array, while the larger elements sink to the bottom. Quick Video Explanation: How Bubble Sort Works Bubble sort works by iterating through the array from left to right and comparing each pair of adjacent elements. If the element on the left is larger than the element on the right, they are swapped. This way, the largest element in the array moves to the rightmost position in each iteration. This process is repeated until no more swaps are needed, which means the array is sorted. To illustrate how bubble sort works, let's use the example of sorting the array [30,90,50,10,40] in ascending order. First Iteration/Pass: The first step is to compare the first two elements, 30 and 90. Since 30 is smaller than 90, they are already i