您的位置：首页 > 理论基础 > 数据结构算法

数据结构与程序设计习题E2-链表

2013-09-05 19:34 316 查看

#include<iostream>

using namespace std;

typedef char Node_entry;

struct Node {

    Node_entry entry;

    Node *next;

    Node();//构造函数

    Node(Node_entry item,Node *add_on=NULL);//构造函数

};

//成员函数实现

Node::Node()

{

    next=NULL;

}

Node::Node(Node_entry item,Node*add_on)

{

    entry=item;

    next=add_on;

}

//E2题

int main()

{

    Node *p0=NULL;

    Node *p1=NULL;

    Node *p2=NULL;

     //a

     p0=new Node('0');

     p1=new Node('1');

     p0->next=p1;

//输出验证链表

     cout<<"p0="<<p0<<" p0->entry="<<p0->entry

     <<" p0->next="<<p0->next<<endl;

     cout<<"p1="<<p1<<" p1->entry="<<p1->entry

     <<" p1->next="<<p1->next<<endl<<endl;

     //b

     p2=p1;

     p1->next=p0;

     p0->next=NULL;

//输出验证链表

     cout<<"p0="<<p0<<" p0->entry="<<p0->entry

     <<" p0->next="<<p0->next<<endl;

     cout<<"p1="<<p1<<" p1->entry="<<p1->entry

     <<" p1->next="<<p1->next<<endl;

     cout<<"p2="<<p2<<endl<<endl;

     delete p0;

     delete p1;

     delete p2;

     //c

     p0=new Node('0');

     p1=new Node('1');

     p2=new Node('2');

     p0->next=p1;

     p1->next=p2;

     p2->next=p1;

//输出验证链表

      cout<<"p0="<<p0<<" p0->entry="<<p0->entry

     <<" p0->next="<<p0->next<<endl;

     cout<<"p1="<<p1<<" p1->entry="<<p1->entry

     <<" p1->next="<<p1->next<<endl;

     cout<<"p2="<<p2<<" p2->entry="<<p2->entry

     <<" p2->next="<<p2->next<<endl;

     delete p0;

     delete p1;

     delete p2;

    return 0;

}

内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理

标签：

相关文章推荐

新的分享

章节导航