Double Link-List in C++

#include<iostream.h>
#include<conio.h>
class node
{
public:
int value,size;
node *nextnode,*headnode,*prenode;
node *lastnode,*currentnode;
public:
node();
void add(int);
int get()
{
return value;
}
void set(int value)
{
this->value=value;
}
void setnext(node *nextnode)
{
this->nextnode=nextnode;
}
node *getnext()
{ return nextnode;}
void setprev(node* prenode)
{this->prenode=prenode;}
node *getprev()
{ return prenode;}
void  display()
{ cout<<"Adress of headnode      "<<headnode<<"       Headnode hold: "<<headnode->getnext()<<endl;
for(node *a=headnode->getnext();a->getnext()!=NULL;a=a->getnext())
{

cout<<"\nAddress of  node:       "<<a;
cout<<"\nAdress of next node:    "<<a->getnext()<<"    Adress of Preves node: "<<a->getprev()<<endl;
cout<<"value of node:  "<<a->value<<endl;

}
}
};
node::node()
{
headnode=new node();
headnode->setnext(NULL);
currentnode=NULL;
size=0;
}
void node::add(int n)
{
node *newnode=new node();
newnode->set(n);
if(currentnode!=NULL)
{
nextnode->setnext(currentnode->getnext());
newnode->setprev(currentnode);
currentnode->setnext(newnode);
lastnode=currentnode;
currentnode=newnode;
}
else
{
newnode->setnext(NULL);
newnode->setprev(headnode);
headnode->setnext(newnode);
lastnode=headnode;
currentnode=newnode;

}
size++;
}
void main()
{
clrscr();
node obj,bol;

obj.add(10);
obj.add(20);
obj.add(30);
obj.add(40);
obj.add(50);

obj.display();

getch();
}

Deletion of Any node in Circular link-List

#include<iostream.h>
#include<conio.h>
class node{
private:
int value,size;
node *last,*first,*nextnode;
public:
node()                     //constructor
{value=size=0; last=first=nextnode=NULL;}
int get()
{ return value;  }
void set(int value)
{ this->value=value; }
node *getnext()
{ return nextnode; }
void setnext(node *nextnode)
{ this->nextnode=nextnode; }
void add(int n)
{
 node *newnode=new node();
 newnode->set(n);
 if(first==NULL && last==NULL)
 {
  newnode->setnext(NULL);
  first=newnode;
  last=newnode;
 }
  else
 {
 last->setnext(newnode);
 newnode->setnext(first);
 last=newnode;
 }
 size++;
}
void display()
{
cout<<"\nAdress of first node: "<<first<<"  Adress first node holding: "<<first->getnext()<<endl;
cout<<"Value of First node:    "<<first->get()<<endl;
for(node *a=first->getnext();a->getnext()!=first->getnext();a=a->getnext())
 {
 cout<<"\nAdres of node:  "<<a<<"    Adress that hold: "<<a->getnext()<<endl;
 cout<<"Value of node:  "<<a->get()<<endl;
 }
}
///// find functions :)
node *find(int n)
{
for(node *a=first->getnext();a!=first;a=a->getnext())
 {
 if(a->get()==n)
 return a;
 }
}
node *find1(node *n)
{
for(node *a=first->getnext();a->getnext()!=n->getnext();a=a->getnext())
 {
 if(a->getnext()==n)
 return a;
 }
}
///// Remove Function
void remove(int n)
{
node *p1=NULL;
 if(first==NULL && last==NULL)
 {  cout<<" \n List is Empty "; return;}
 else if(first==last && n==first->get())
 {  delete first,last; first=last=NULL; cout<<"\nvalues delete";return; }
else
 {
  node *p=find(n);

  if(p==first)
   { p1=last;
    p1->setnext(first->getnext());
    first=first->getnext();
    delete p;
   }
  else if(p==last)
     { p1=find1(p);
       p1->setnext(p->getnext());
       last=p1;
       delete p;
     }
   else
   {
     p1=find1(p);
     p1->setnext(p->getnext());
      delete p;
   }
 }
}
};
 void main()
 {
 clrscr();
 int v=0;
 node obj;
 obj.add(11);
 obj.add(12);
 obj.add(13);
 obj.add(14);
 obj.add(15);
 obj.add(16);
obj.display();
while(getch()==13)
 {
 cout<<"\n\nEnter the value of node you want to delete: ";
 cin>>v;
 clrscr();
 obj.remove(v);
 obj.display();
 cout<<"\n\n\n\n\t Delete other  ::Enter    ||   Exit::Any Key ";

 }
}

Circular Link-List in C++

#include<iostream.h>
#include<conio.h>
class node{
private:
int value,size;
node *last,*first,*nextnode;
public:
node()                     //constructor
{ last=first=NULL; }
int get()
{ return value;  }
void set(int value)
{ this->value=value; }
node *getnext()
{ return nextnode; }
void setnext(node *nextnode)
{ this->nextnode=nextnode; }
void add(int n)
{
 node *newnode=new node();
 newnode->set(n);
 if(first==NULL && last==NULL)
 {
  newnode->setnext(NULL);
  first=newnode;
  last=newnode;
 }
  else
 {
 last->setnext(newnode);
 newnode->setnext(first);
 last=newnode;
 }
 size++;
}
void display()
{
cout<<"Adress of first node: "<<first<<"  Adress first node holding: "<<first->getnext()<<endl;
for(node *a=first->getnext();a->getnext()!=first->getnext();a=a->getnext()){
cout<<"Adres of node: "<<a<<"    Adress that hold: "<<a->getnext()<<endl;
cout<<"Value of node: "<<a->get()<<endl<<endl;
}
}
};
 void main()
 {
 clrscr();
 node obj;
 obj.add(22);
 obj.add(33);
 obj.add(44);
 obj.add(55);
obj.display();
getch();
  }

Concatenate or Merge two Linklists in C++

#include<iostream.h>
#include<conio.h>
class node
{
public:
int value,size;
node *nextnode,*headnode;
node *lastnode,*currentnode;
public:
node();
void add(int);
int get()
{
return value;
}
void set(int value)
{
this->value=value;
}
void setnext(node *nextnode)
{
this->nextnode=nextnode;
}
node *getnext()
{
return nextnode;
}

void  display()
{ cout<<"headnode hold: "<<headnode->getnext()<<endl;
for(node *a=headnode->getnext();a->getnext()!=NULL;a=a->getnext())
{

cout<<"Adress of  node:  "<<a<<"      Adress holdin /next node:  "<<a->getnext()<<endl;
cout<<"value of node:  "<<a->value<<endl<<endl;

}
}
friend void  conc( node c,node b)
{
c.currentnode->setnext(b.headnode->getnext());
delete b.headnode;
}
};
node::node()
{
headnode=new node();
headnode->setnext(NULL);
currentnode=NULL;
size=0;
}
void node::add(int n)
{
node *newnode=new node();
newnode->set(n);
if(currentnode!=NULL)
{
nextnode->setnext(currentnode->getnext());
currentnode->setnext(newnode);
lastnode=currentnode;
currentnode=newnode;
}
else
{
newnode->setnext(NULL);
headnode->setnext(newnode);
lastnode=headnode;
currentnode=newnode;

}
size++;
}
void main()
{
clrscr();
node obj,bol;
obj.add(11);
obj.add(20);
obj.add(30);
obj.add(40);
obj.display();
cout<<"Press any key to see 2nd link list: ";
getch();
clrscr();
cout<<endl<<"XXXXXXXXXXXXXXXXX"<<endl;
bol.add(25);
bol.add(23);
bol.add(22);
bol.display();
cout<<"Press any key to see 1st link list after concatination or merging ";
getch();
clrscr();
conc(obj,bol);
obj.display();
getch();
}

Insertion at any point in LINK-LIST

#include<iostream.h>
#include<conio.h>
class node
{
private:
int value,size;
node *nextnode,*headnode;
node *lastnode,*currentnode;
public:
node();
void add(int);
int get()
{
return value;
}
void set(int value)
{
this->value=value;
}
void setnext(node *nextnode)
{
this->nextnode=nextnode;
}
node *getnext()
{
return nextnode;
}
void inline display()
{
for(node *a=headnode->getnext();a->getnext()!=NULL;a=a->getnext())
{

cout<<"address of  node  "<<a<<"       "<<a->getnext()<<endl;
cout<<a->value<<endl;

}
}
void find(int z)
{
int x;
cout<<endl<<"enter value";
cin>>x;
for(node *a=headnode->getnext();a->getnext()!=NULL;a=a->getnext())
if(a->get()==z)
currentnode=a;
node *newnode=new node();
newnode->set(x);
newnode->setnext(currentnode->getnext());
currentnode->setnext(newnode);
   }
};
node::node()
{
headnode=new node();
headnode->setnext(NULL);
currentnode=NULL;
size=0;
}
void node::add(int n)
{
node *newnode=new node();
newnode->set(n);
if(currentnode!=NULL)
{
nextnode->setnext(currentnode->getnext());
currentnode->setnext(newnode);
lastnode=currentnode;
currentnode=newnode;
}
else
{
newnode->setnext(NULL);
headnode->setnext(newnode);
lastnode=headnode;
currentnode=newnode;

}
size++;
}
void main()
{
clrscr();
int q;
node obj;
obj.add(10);
obj.add(20);
obj.add(30);

obj.add(40);
obj.display();
cout<<endl<<"Enetr a value for search: ";
cin>>q;
obj.find(q);
obj.display();
getch();
}

How to create a single linklist in C++

#include<iostream.h>
#include<conio.h>
class node{
private:
int value,size;
node *newnode,*currentnode,*prevnode,*headnode,*lastnode,*nextnode;
public:
node();
void add(int);
int get()
{
 return value;
}
void set(int value)
{
this->value=value;
}
node *getnext()
{
return nextnode;
}
void setnext(node *nextnode)
{
this->nextnode=nextnode;
}
node *getprev()
{
return prevnode;
}
void setprev(node *prevnode)
{
this->prevnode=prevnode;
}
};
node::node()
{
headnode=new node();
headnode->setnext(NULL);
currentnode=NULL;
size=0;
}
void node::add(int n)
{
node *newnode=new node();
newnode->set(n);
if(currentnode!=NULL)
{
newnode->setnext(currentnode->getnext());
currentnode->setnext(newnode);
lastnode=currentnode;
currentnode=newnode;
}
else
{
newnode->setnext(NULL);
headnode->setnext(newnode);
lastnode=headnode;
currentnode=newnode;
}size++;
}

void main()
{
node obj;
obj.add(10);
obj.add(20);
getch();
}

Data Structure Programs

Read Also:  

• How to download or Open Instagram private profile picture online

• How to download youtube songs in audio online

• How to add new currency in woo commerce WordPress

• How to Change Font in Whatsapp Chat

• How to calculate distance between two coordinates without map API in PHP

• How to calculate distance between two coordinates using Google Map API in PHP

• Top 5 Best Website to Earn Online in 2021

---

"All Data Structure Programs up-till now"

To get code Click on that program heading :) ☺ ☻ 

 ALL Type Of Sorting : Click here :: most important :: 

-------------------

TREES:- 

  RED AND BLACK TREE IN C++

Insertion- Deletion- Searching -Max,Min Tree C++ Code

Tree Non Liner Data Structure   

Insert 100 in all Leaf nodes and 10 in all non leaf nodes using BST in C++ 


Convert Left Sub Tree of a Root into Right Sub Tree and Right sub Tree into Left Sub Tree ☺ ☻


Insert A Value on Left Side which is greater Then Root and Small Value on Right side


Traverse root left sub tree with post order ☻ and then print root ☻ and then root right sub tree with pre order ☻


Find Minimum node make it Root node attach rest of Tree with it such that BST property is not violated


Take Maximum Node Make it Root Node and attach rest of tree with it so that BST Property will not volatilized 



Traverse Tree According To User Value :Get Value From User ☻
---------------------

`Queues 

* Circular D-Queue [ double ended queue ]

* Linear D - Queue

* Priority Queue

* Implementation of Linear Queue

* Creation of Circular Queue

----------------

`Single Link-List:

*  How to create single Link-list in C++

*  Insertion at any point in link-list in C++

*  Concatenate or Merge two Link-lists in C++

`Circular Link-list:

Creation of circular link list in C++

Deletion At any point in Circular Link List in C++
------------------------------------

`Double Link-list:

Creation of Double link-list in C++

=================

Stacks Data Structure:

Implementation of stacks using Array in C++

Decimal to binary conversion using stack in c++
============ 

How to add two matrix size is define by use

Recursion in c programming

Insertion and Deletion in array at any Point size define by user

C++ program to find Fibonacci sequence of any number

Program to print your name 10 time using Recursion

Program to print counting 1 t0 10 using Recursion

Program to find Factorial of any number given by user

Program to print counting 10 to 1 using Recursion

--------------------------------------------------

Tag : C Programming, C++, Data Structure, heap, Interesting Programs, link list, Queue, Sorting, Stack, tree    Read more