双向链表

#include<iostream>
using namespace std;
#define Elemtype int
#define INIT_SIZE 10
typedef struct node
{
Elemtype data;
node* prior;
node* later;
}node,*pnode;
pnode init_list()
{
pnode head;
head = (pnode)malloc(sizeof(node));
head->prior = NULL;
head->later = NULL;
return head;
}
pnode s_malloc()
{
pnode node = (pnode)malloc(sizeof(node));
return node;
}
void create_list(pnode& head, int size)
{
pnode prior;
prior = head;
for (int i = 0; i < size; i++)
{
pnode node;
node = s_malloc();
prior->later = node;
node->prior = prior;
node->data = i;
node->later = NULL;
prior = node;
}
}
bool node_insert(pnode head,int loc,int val)
{
int i = 1;
pnode node;
node=head;
pnode insert_node = s_malloc();
insert_node->data = val;
if (loc < i)
return false;
else
{
while (node != NULL&&i < loc)
{
node = node->later;
i++;
}
if (node == NULL)
{
return false;
}
else
{
insert_node->later = node->later;
node->later->prior = insert_node;
node->later = insert_node;
insert_node->prior = node;
}
}
}
bool node_delete(pnode& head, int loc)
{
pnode node = head;
int i = 1;
if (loc < i)
return false;
else
{
while (node != NULL&&i <= loc)
{
node = node->later;
i++;
}
if (node != NULL)
{
node->prior->later = node->later;
node->later->prior = node->prior;
free(node);
return true;
}
else
return false;
}
}
int main()
{
pnode head;
head=init_list();
pnode temp = head;
create_list(head, INIT_SIZE);
for (int i = 0; i < INIT_SIZE; i++)
{
cout << temp->later->data<<' ';
temp = temp->later;
}
node_insert(head, 3, 100);
node_delete(head, 3);
return 0;
}