Exercises 4.1 E2
来源:互联网 发布:幼儿学空手道 知乎 编辑:程序博客网 时间:2024/04/28 15:10
E2. Write the C++ statements that are needed to create the linked configuration of nodes shown in each of the flloeing diagrams.For each part,embed these statements as part of a program that printfs the contents of each node(both data and next),thereby demonstrating that the nodes have been correctly linked.
(a)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;
(b)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
Node*p2=Node('1',p0);
(c)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;
Node*p2=Node('2',p1);
p1->next=p2;
(a)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;
(b)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
Node*p2=Node('1',p0);
(c)
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;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;
Node*p2=Node('2',p1);
p1->next=p2;
- Exercises 4.1 E2
- Exercises 4.1 E2
- Exercises 4.1 E2
- Exercises 4.1 E2
- Exercises 4.1 E2
- Exercises 4.1 E2
- Exercises 4.1 E2(原创)
- Exercises 2.2 E2(b)
- exercises 2.2 E2 (b )
- Exercises 4.2 E2 (a)
- Exercises 4.3 E2
- Exercises 2.2 E2(b)解答
- Exercises 2.2 E2(b)解答
- 4.1E2
- 4.1 e2
- 4.1E2
- 4.1 E2
- 4.1 E2
- oracle 递归查询2
- NYOJ239 月老的难题 二分图最大匹配(前向星)
- yum 源配置
- Eclipse快捷键 10个最有用的快捷键
- The JRE could not be found. Edit the server and change the JRE location.
- Exercises 4.1 E2
- 大数据时代的数学思维(3)-初等代数-python计算
- android隐藏以及显示软键盘以及不自动弹出键盘的方法
- 【D3.js数据可视化系列教程】--(五)用层画条形图
- Eclipse常用快捷键的使用(二)
- 迁移学习心得,从OpenStack到QEMU
- poj 2112 Optimal Milking 网络流 最大流
- android中<include />标签的用法
- C/C++程序员应聘常见面试题剖析