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

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)  ...
Post a Comment
Read more

Sum Of Given Array Elements

public static void main( String [] args){ int [] arr={ 1 , 2 , 3 , 4 , 5 , 6 }; int n=arr.length; int sum= 0 ; for ( int i= 0 ;i<n;i++){ sum+=arr[i]; } System.out.println(sum); } } Java Programming /* Sum Of Given Array Elements Time Complexity O(n) */   class sumOfArray{
Post a Comment
Read more