数据结构 链表(二)

双向链表的C++实现

#pragma once
typedef struct Node
{
   
	int value;
	Node* prev;
	Node* next;
}node;

class DoubleLinklist
{
   
private:
	int size;
	node* head;
	node* tail;
public:
	DoubleLinklist();
	~DoubleLinklist();
	//获取链表大小
	int GetSize();
	//判断是否为空
	bool IsEmpty();
	//尾插法插入元素节点
	void Insert(node* n);
	//头插法插入元素节点
	void HeadInsert(node* n);
	//指定位置后插入数据
	void PosInsert(int pos, node* n);
	//获取指定位置元素，并打印
	void GetPosElem(int pos);
	//搜索指定元素并打印位置
	void SearchElem(int elem);
	//删除指定元素
	void DelPosElem(int pos);
	//打印链表
	void ShowLinklist();
	//反转打印链表
	void ReverseShowLinklist();
	//清除所有数据
	void ClearLinklist();
};

#include"doublelinlist.h"
#include<iostream>
using std::cout;
using std::cin;
using std::endl;

DoubleLinklist::DoubleLinklist()
{
   
	this->size = 0;
	this->head = new node;
	this->head->value = NULL;
	this->head->prev = this->head->next = NULL;
	this->tail = new node;
	this->tail->next = this->tail->prev = NULL;
	this->tail->value = NULL;
}

DoubleLinklist::~DoubleLinklist()
{
   
	delete[]head;
	delete[]tail;
}

int DoubleLinklist::GetSize()
{
   
	cout << "NOW LINKLIST SIZE == ";
	cout << this->size << endl;
	
	return this->size;
}

bool DoubleLinklist::IsEmpty()
{
   
	if (this->size)
		return false;
	else
		return true;
}

void DoubleLinklist::Insert(node* n)
{
   
	if (n)
	{
   
		node* temp = new node;
		temp->next = temp->prev = NULL;
		temp->value = n->value;

		if (this->IsEmpty())
		{
   
			this->head->next = temp;
			temp->next = this->tail;
			this->tail->prev = temp;
			temp->prev = this->head;
		}
		else
		{
   
			node* pnode = this->tail->prev;
			pnode->next = temp;
			temp->next = this->tail;
			this->tail->prev = temp;
			temp->prev = pnode;
		}

		this->size++;
	}
	else
	{
   
		cout << "UNDEFINE NODE\n";
	}
	
}

void DoubleLinklist::HeadInsert(node* n)
{
   
	if (n)
	{
   
		node* temp = new node;
		temp->next = temp->prev = NULL