当前位置:网站首页>Bidirectional linked list - all operations
Bidirectional linked list - all operations
2022-07-06 16:13:00 【Handsome black cat Sheriff】
initialization , Tail insertion ( Head insert similar , It is equivalent to the last insertion of the previous digit ), Traverse , Insert , Delete , Sentenced to empty
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef struct dnode{ // Define data types
int data;
struct dnode *prior,*next; // Double linked list has two pointers !
}dnode,*dlinklist;
bool initdlinklist(dlinklist &l) // Initializing a double linked list
{
l=(dnode *)malloc(sizeof(dnode));
if(l==NULL)
return 0;
l->prior=NULL;
l->next=NULL; // Both the head pointer and the tail pointer are set null
return 1;
}
bool empty(dlinklist l) // Judge that the linked list is not empty
{
if(l->next==NULL)
return 1;
else
return 0;
}
bool insertdlinklist(dlinklist &l,int i,int e) // The insert
{
int j=0;
dnode *p,*s;
p=(dnode *)malloc(sizeof(dnode));
p=l;
while(p->next!=NULL&&j<i-1)
{
j++;
p=p->next;
}
if(p==NULL||j!=i-1) // Robust code
return 0;
s=(dnode *)malloc(sizeof(dnode));
s->data=e;
s->next=p->next;
if(p->next!=NULL)
p->next->prior=s;
p->next=s;
s->prior=p;
return 1;
}
bool deletedlinklist(dlinklist &l,int i,int &e) // Delete operation
{
int j=0;
dnode *p;
p=(dnode *)malloc(sizeof(dnode));
p=l;
while(p->next!=NULL&&j<i)
{
j++;
p=p->next;
}
if(p==NULL||j!=i) // Robust code
return 0;
e=p->data;
if(p->prior!=NULL)
p->prior->next=p->next;
if(p->next!=NULL) // Judge whether it is the last
p->next->prior=p->prior;
free(p);
return 1;
}
dlinklist dlinklist_tailinsert(dlinklist &l) // Tail insertion
{
int x;
dnode *p,*s;
p=(dnode *)malloc(sizeof(dnode));
p=l;
cin>>x;
while(x!=0)
{
s=(dnode *)malloc(sizeof(dnode));
s->data=x;
s->next=NULL;
p->next=s;
s->prior=p;
p=s;
cin>>x;
}
return l;
}
void lookdlinklist(dlinklist l) // Traverse
{
dnode *p;
int j=1;
p=(dnode *)malloc(sizeof(dnode));
p=l->next;
while(p!=NULL)
{
cout<<"number "<<j<<" is "<<p->data<<" , ";
j++;
p=p->next;
}
cout<<endl;
}
int main() {
dlinklist l;
if(initdlinklist(l))
cout<<"initdlinklist succeed"<<endl;
if(empty(l))
cout<<"dlinklist is empty!"<<endl;
else cout<<"dlinklist not empty!"<<endl;
dlinklist_tailinsert(l);
if(empty(l))
cout<<"empty"<<endl;
else cout<<"not empty"<<endl;
lookdlinklist(l);
if(insertdlinklist(l,2,88)&&(insertdlinklist(l,4,99)))
cout<<"insertdlinklist succeed\n";
else cout<<"insertdlinklist faild\n";
lookdlinklist(l);
int e=0;
if(deletedlinklist(l,2,e))
cout<<"deletedlinklist succeed,delete element is "<<e<<endl;
else cout<<"delete error"<<endl;
lookdlinklist(l);
cout << "over\n";
return 0;
}
边栏推荐
猜你喜欢
2027. Minimum number of operations to convert strings
Frida hook so layer, protobuf data analysis
969. Pancake sorting
Penetration test (3) -- Metasploit framework (MSF)
Nodejs+vue online fresh flower shop sales information system express+mysql
Determine the Photo Position
Quick to typescript Guide
(POJ - 3685) matrix (two sets and two parts)
MySQL import database error [err] 1273 - unknown collation: 'utf8mb4_ 0900_ ai_ ci’
Web based photo digital printing website
随机推荐
Openwrt source code generation image
If you want to apply for a programmer, your resume should be written like this [essence summary]
MySQL import database error [err] 1273 - unknown collation: 'utf8mb4_ 0900_ ai_ ci’
Basic Q & A of introductory C language
滲透測試 ( 1 ) --- 必備 工具、導航
Borg maze (bfs+ minimum spanning tree) (problem solving report)
Candy delivery (Mathematics)
socket通讯
1855. Maximum distance of subscript alignment
Vs2019 initial use
树莓派4B64位系统安装miniconda(折腾了几天终于解决)
Penetration testing (5) -- a collection of practical skills of scanning King nmap and penetration testing tools
Nodejs crawler
Auto.js入门
Information security - threat detection - Flink broadcast stream broadcaststate dual stream merging application in filtering security logs
Interval sum ----- discretization
渗透测试 ( 2 ) --- 渗透测试系统、靶机、GoogleHacking、kali工具
Essai de pénétration (1) - - outils nécessaires, navigation
QWidget代码设置样式表探讨
D - function (HDU - 6546) girls' competition