/Java/How to implement linked list in java without using collection framework

How to implement linked list in java without using collection framework

public class linkedlist
{
    public static class Node         //We are defining a node  here
    {
        int data;       //data of node here
        Node next;      //next refers to the address of the next node
        
    }
    public static void main(String args[])
    {
        Node newnode1=new Node();    //here we are making objects of class Node
        Node newnode2=new Node();    //basically these are nodes of first linkedlist
        Node newnode3=new Node();    
        Node newnode4=new Node();    
        newnode1.data=1;
        newnode2.data=2;
        newnode3.data=3;
        newnode4.data=4;
         
          
        newnode1.next=newnode2;       //here we are linking the previous node to the next node of the list 
        newnode2.next=newnode3;
        newnode3.next=newnode4;
        newnode4.next=null;

        //Now we will print the linked list

       for (int i=1;i<=4;i++)
        {
            System.out.print(newnode1.data+" ");
            newnode1=newnode1.next;       //we are assigning the next address of the linked list to the current address 
        }
    }
}

<div class="open_grepper_editor" title="Edit & Save To Grepper"></div>

Similar codes

3 votes146 views3 answers
Fibonacci java
Java
0 vote124 views1 answer
Ignore sonarlint line java
Java
5 votes152 views1 answer
Print up to 2 decimal in java
Java
1 vote127 views1 answer
Private properties in JavaScript ES6 classes
Java
0 vote116 views1 answer
Delete Specials Caractères from a String in java
Java
0 vote150 views1 answer
Junit check class type
Java
0 vote121 views1 answer
Sartt timer of 40 second when send otp andrpid
Java
55 votes123 views4 answers
How to get last element in java
Java
0 vote121 views3 answers
Bf5 cheat detector
Java
59 votes123 views3 answers
How to use math.round
Java