#include <iostream>
using namespace std;
class Node{
public:
char data;
Node *next;
Node *prve;
};
int main()
{
Node *head=new(Node);
Node *p=head;
p->prve=nullptr;
p->next=nullptr;
char ch;
cin>>ch;
p->data=ch;
while(cin>>ch){
p->next=new(Node);
p->next->prve=p;
p=p->next;
p->data=ch;
p->next=nullptr;
}
Node *q=p;
while(q!=nullptr){
cout<<q->data<<endl;
q=q->prve;
}
return 0;
}
双向链表的构建
最新推荐文章于 2024-05-05 19:23:34 发布