Skip to main content

Linked List - Data Structure Basic With Example Java


//linked list
/*
    Linked List is a Linear Data Structure.
    
Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node
Contains Data And Pointer.


Header Is Used To Denote The First Node Of Linked List.

Tail Is Used To Denote the Last Node of The Linked List.


1.Singly Linked List
Each Node as Data And pointer To The Next Node.
[ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null];

2.doubly Linked List
Each Node as Data And pointer To The Next Node and prev Node.
[ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null];

3.Circle Linked List

[ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header
*/



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

class linkedlist{

//Header Object of List
node header;

//Current Object of List
node current;


//Constractor to Instalize a Value of header as null
linkedlist(){
header=null;
}

//Add New Node To List
public void add(int data){

//Check If Heaer Is Null Or Not
if(header==null){
header=new node(data);
current=header;
// /System.out.println(current==header);
}
else{
current.next=new node(data);
current=current.next;
}
}


//Traverse Linked List Using Through List header
public void traverse(node header){
while(header!=null){
System.out.println(header.data);
header=header.next;
}
}

//Linked List Count Number Of Node in given List Using List Header
public int count(node header){
int counter=0;
while(header!=null){
counter+=1;
header=header.next;
}
return counter;
}

//Linked List Count Number Of Node in given List Using List Object
public int countByList(linkedlist list){
int counter=0;
while(list.header!=null){
counter+=1;
list.header=list.header.next;
}
return counter;
}

public static void main(String[] args){
linkedlist l=new linkedlist();
linkedlist l2=new linkedlist();
l.add(5);
l.add(10);
l.add(15);
l.add(20);
l.add(25);
l.add(30);
l.add(35);
l.add(40);
        l.traverse(l.header);
System.out.println(l.countByList(l));
}
}
Labels:

Comments

Post a Comment

Popular posts from this blog

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...
1 comment
Read more

if control statement - Basic Programming Concepts With psudo Code

if( )  is a control statement. it based on some condition. if the condition can true the block of statements can execute other wise skip the statements. syntax if([condition]) { //statement; } example1, #include<stdio.h> #include<conio.h> main() int num=1; { if(num==1) { printf("\n its true"); } } from the above program we can declare the variable named as num and assign the value as 1. then, check the value 1 equal value of num through if statement.the statement can true.so, the block of statements can executed. example2, #include<stdio.h> #include<conio.h> main() int num=5; { if(num==1) { printf("\n its true"); } } suppose the value of num is 5.the block of if statement can skip to execution.
Post a Comment
Read more

Stack is Linear Data Structure- Basic DSA In Java Programming

  /* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...
Post a Comment
Read more