双链表的头插法和尾插法创建

双链表的尾插法和头插法创建

typedef struct my {
int data;
struct my *next, *prior;
}my1;
my1 *dlist1() //尾插法建立双向链表的函数//
{
my1 *head, *q, *p;
int n, a,i;
head = (my1*)malloc(sizeof(my1));
head->next = NULL;
head->prior = NULL;
q = head;
printf(“尾插法，你的链表一共有多少元素：”);
scanf_s(“%d”, &n);
printf(“用尾插法，请输入你的双链表的元素：”);
for (i = 0; i < n; i++)
{
scanf_s(“%d”, &a);
p = (my1*)malloc(sizeof(my1));
p->data = a;
q->next = p;
p->prior = q;
q = p;
}
q->next = NULL;
return (head);
}
my1 *dlist2() //头插法建立双向链表的函数//
{
my1 *head, *q, *p;
int n, a, i;
head = (my1*)malloc(sizeof(my1));
head->next = NULL;
head->prior = NULL;
q = head->next;
printf(“\n头插法，你的链表一共有多少元素：”);
scanf_s(“%d”, &n);
printf(“用头插法，请输入你的双链表的元素：”);
for (i = 0; i < n; i++)
{
scanf_s(“%d”, &a);
p = (my1*)malloc(sizeof(my1));
p->data = a;
head->next = p; //头插法前部链接//
p->prior = head->next; //头插法前部链接//
p->next = q; //头插法后部连接//
if (q != NULL) //从第二个元素开始的第一个与第二个节点链接的条件//
{
q->prior = p; //从第二个元素开始的第一个与第二个节点链接//
}
q = p;
}
return (head);
}
int main()
{
my1 *a,*b;
a = dlist1();
a = a->next;
printf(“尾插法，你的双链表元素为：”);
while (a != NULL)
{
printf(“%d “, a->data);
a = a->next;
}
b = dlist2();
b = b->next;
printf(“头插法，你的双链表元素为：”);
while (b != NULL)
{
printf(“%d “, b->data);
b = b->next;
}
getchar();
getchar();
}