直接以操作链表的方式操作节点

最新推荐文章于 2022-10-05 22:59:12 发布

崖高人远

最新推荐文章于 2022-10-05 22:59:12 发布

阅读量579

点赞数

分类专栏： C++数据结构文章标签： n2 include struct null

C++数据结构专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;

typedef int T;
//节点类
//struct 也称类？
struct Node
{
	T data;
	Node* next;
	Node(const T& d):data(d),next()
	{
		
	}
};

void print(Node* p)
{
	while(p != NULL)
	{
		cout << p->data << ' ';
		p = p->next;
	}
	cout << endl;
}

int main()
{
	Node n1(10),n2(20),n3(30),n4(40);
	n1.next = &n2;		
	n2.next = &n3;
	n3.next = &n4;
	Node* p = &n1;
	print(p);
	Node n5(50);	
	n5.next = &n4;
	n3.next = &n5;
	print(p);
	n2.next = &n5;
	print(p);
	n2.next = &n5;
	print(p);
	p = p->next;
	print(p);
	p = &n1;
	Node*& pr = n2.next;
	pr = &n4;  //n2.next = &n4;
	print(p);
	typedef Node* root;
	root& r = n1.next;
	r = &n4;
	print(p);
}