数据结构的插入操作

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

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个节点,返回false
return false;
else //找到第i-1个节点*p,插入新节点并返回1
{
s = (LinkList *)malloc(sizeof(LinkList));
s -> data = e;//创建新节点*s,其data域置为e
s -> next = p -> next;//将*s插入到*p之后
p -> next = s;
return true;
}
}

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));//创建新结点*s
s -> data = e;
s -> next = p -> next;//将*s插入到*p之后
if (p -> next != NULL) p -> next -> prior = s;
s -> prior = p;
p -> next = s;
return true;
}
}

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));//创建新结点*s
s -> 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));//创建新结点*s
s -> data = e;
s -> next = p -> next;//将*s插入到*p之后
p -> next = s;
return true;
}
}
}

bool ListInsert(DLinkList *&L, int i, ElemType e) //插入数据元素
{
int j = 0;
DLinkList *p = L, *s;
if (p -> next == L)//原双链表为空表时
{
s = (DLinkList *)malloc(sizeof(DLinkList));//创建新结点*s
s -> 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));//创建新结点*s
s -> 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));//创建新结点*s
s -> data = e;
s -> next = p -> next;//将*s插入到*p之后
if (p -> next != NULL) p -> next -> prior = s;
s -> prior = p;
p -> next = s;
return true;
}
}
}

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

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

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;
}

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;
}
}