数据结构的插入操作

1.顺序表的插入：

bool ListInsert(SqList *&L, int i, ElemType e) //插入数据元素{int j;if (i < 1 || i > L -> length + 1)return false; //参数错误时返回falsei--; //将顺序表逻辑序号转化为物理序号for (j = L -> length; j > i; j--)//将data[i]及后面元素后移一个位置L -> data[j] = L -> data[j - 1];L -> data[i] = e;//插入元素eL -> length++;//顺序表长度增1return true; //成功插入返回true}

2.单链表的插入：

bool ListInsert(LinkList *&L, int i, ElemType e) //插入数据元素{int j = 0;LinkList *p = L, *s;//p指向头节点,j置为0(即头节点的序号为0)while (j < i - 1 && p != NULL)//查找第i-1个节点{ j++;p = p -> next;}if (p == NULL)//未找到第i-1个节点,返回falsereturn false;else //找到第i-1个节点*p,插入新节点并返回1{ s = (LinkList *)malloc(sizeof(LinkList));s -> data = e;//创建新节点*s,其data域置为es -> next = p -> next;//将*s插入到*p之后p -> next = s;return true;}}

3.双链表的插入：

bool ListInsert(DLinkList *&L, int i, ElemType e) //插入数据元素{int j = 0;DLinkList *p = L, *s;while (j < i-1 && p != NULL){j++;p = p -> next;}if (p == NULL)//未找到第i-1个结点return false;else //找到第i-1个结点*p{s=(DLinkList *)malloc(sizeof(DLinkList));//创建新结点*ss -> data = e;s -> next = p -> next;//将*s插入到*p之后if (p -> next != NULL) p -> next -> prior = s;s -> prior = p;p -> next = s;return true;}}

4.循环单链表的插入：

bool ListInsert(LinkList *&L, int i, ElemType e) //插入元素{int j = 0;LinkList *p = L, *s;if (p -> next == L || i == 1)//原单链表为空表或i==1时{s = (LinkList *)malloc(sizeof(LinkList));//创建新结点*ss -> data = e;s -> next = p -> next;//将*s插入到*p之后p -> next = s;return true;}else{p = L -> next;while (j < i - 2 && p != L){j++;p = p -> next;}if (p == L) //未找到第i-1个结点return false;else //找到第i-1个结点*p{s = (LinkList *)malloc(sizeof(LinkList));//创建新结点*ss -> data = e;s -> next = p -> next;//将*s插入到*p之后p -> next = s;return true;}}}

5.循环双链表的插入：

bool ListInsert(DLinkList *&L, int i, ElemType e) //插入数据元素{int j = 0;DLinkList *p = L, *s;if (p -> next == L)//原双链表为空表时{ s = (DLinkList *)malloc(sizeof(DLinkList));//创建新结点*ss -> data = e;p -> next = s; s -> next = p;p -> prior = s; s -> prior = p;return true;}else if (i == 1)//原双链表不为空表但i=1时{s = (DLinkList *)malloc(sizeof(DLinkList));//创建新结点*ss -> data = e;s -> next = p -> next;p -> next = s;//将*s插入到*p之后s -> next -> prior = s; s -> prior = p;return true;}else{ p = L -> next;while (j < i - 2 && p != L){j++;p = p -> next;}if (p == L) //未找到第i-1个结点return false;else //找到第i-1个结点*p{s = (DLinkList *)malloc(sizeof(DLinkList));//创建新结点*ss -> data = e;s -> next = p -> next;//将*s插入到*p之后if (p -> next != NULL) p -> next -> prior = s;s -> prior = p;p -> next = s;return true;}}}

6.顺序栈的进栈：

bool Push(SqStack *&s, ElemType e) //进栈{     if (s -> top == MaxSize - 1) //栈满的情况，即栈上溢出return false;s -> top++; //栈顶指针增1s -> data[s -> top] = e;//元素e放在栈顶指针处return true;}

7.链栈的进栈：

void Push(LiStack *&s, ElemType e) //进栈{ LiStack *p;p = (LiStack *)malloc(sizeof(LiStack));p -> data = e;//新建元素e对应的节点*pp -> next = s -> next;//插入*p节点作为开始节点s -> next = p;}

8.顺序队列的入队：

bool enQueue(SqQueue *&q, ElemType e) //进队{if ((q -> rear + 1) % MaxSize == q -> front)//队满上溢出return false;q -> rear = (q -> rear + 1) % MaxSize;q -> data[q -> rear] = e;return true;}

9.链队列的入队：

void enQueue(LiQueue *&q,ElemType e) //进队{QNode *p;p = (QNode *)malloc(sizeof(QNode));p -> data = e;p->next=NULL;if (q -> rear == NULL)//若链队为空,则新节点是队首节点又是队尾节点q -> front = q -> rear = p;else{ q -> rear -> next = p;//将*p节点链到队尾,并将rear指向它q -> rear = p;}}