Skip to main content

Reversed Linked List- Using Header Of Linked LIst

class node{
int data;
node next;
node(int data){
this.data=data;
}
}

class reverseLinkedList{
node head;
node tail;
node temp;

    //Constructor
reverseLinkedList(){
head=null;
}
    
    //Reverse Linked List Using Traverse And Add First To New List And Return a List
public reverseLinkedList reverse(node head){
reverseLinkedList r2=new reverseLinkedList();
while(head!=null){
r2.addFirst(head.data);
head=head.next;
}
return r2;
}
    
    //Add First Position
public void addFirst(int data){
if(head==null){
head=new node(data);
}
else{
temp=new node(data);
temp.next=head;
head=temp;
}
}
    
    //Add Node To Last Element
public void addNode(int data){
if(head==null){
head=new node(data);
tail=head;
}
else
{
tail.next=new node(data);
tail=tail.next;
}
}
    
    //Traverse a Linked List
public void traverse(node head){
while(head!=null){
System.out.println(head.data);
head=head.next;
}
}


    //Main Function
public static void main(String[] args){
reverseLinkedList r=new reverseLinkedList();
r.addNode(5);
r.addNode(10);
r.addNode(15);
r.addNode(20);
r.addNode(25);
r.addNode(30);
r.addNode(35);
r.addNode(40);
r.traverse(r.head);
System.out.println("Reversed!!!");
r.traverse(r.reverse(r.head).head);
}

}
Labels:

Comments

Post a Comment

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method
Post a Comment
Read more

Array - Java Programming

//Array Is a Basic Data Structure in Computer Programming. Array Have Continues Memory Allocation in Memory Space. Data Are Stored In Continues memory space . We Access Using the index Of The Element. Index Start From 0 to n-1 //Basic Operations in Array /* traverse search find insert Remove */ class array{ //Traverse A Array public static void traverse( int [] arr){ int n=arr.length; for ( int i= 0 ;i<n;i++){ System.out.println(arr[i]); } } //Find Value By Index public static void findByIndex( int [] arr, int index){ System.out.println(arr[index]); } //Find Index By Value public static void findIndex( int [] arr, int value){ int n=arr.length; for ( int i= 0 ;i<n;i++){ if (arr[i]==value){ System.out.println(i); } } } //Insert Function (Array Copy Method) public static void insert( int [] arr, int index, int v...
Post a Comment
Read more