void fun(SeqList *L, DataType x)

{

inti =0, j;

while (i<L->length && x>L->data[i]) i++;

if(i<L->length && x==L->data[i])

{

for(j=i+1;j<L->length;j++)

L->data[j-1]=L->data[j];

L->length--;

}

else

{

for(j=L->length;j>i;j--)

L->data[j]=L->data[j-1];

L->data[i]=x;

L->length++;

}

}

< include < iostream. h>

< include < stdlib. h >

consst int stackmaxsize = 30;

typedef intelemtype;

struct stack {

elemtype stack [stackmaxsize];

int top;

};

< include “stack. h”

void main ( )

{

stack a;

initstack(a);

int x;

cin >>x;

while (x! = -1) {

push (a, x );

cin >>x;

}

while (!stackempty (a))

cout <<pop (a) <<”” ;

cout <<end1;

}

LinkList mynote(LinkList L)

{//L是不带头结点的单链表的头指针

if(L&&L->next)

q=L;L=L->next;p=L;

while(p->next) p=p->next;

S1：p->next=q;q->next=NULL;

}

return L;

}

下列算法fun，简述算法fun 的功能。

void fun(LinkList L)

{//L为带头结点单链表的头指针

ListNode *p,*q;

p=L;

while(p&&p->next)

{

q=p->next;

p->next=q->next;

p=q->next;

free(q)

}

}

void ABC(BTNode * BT)

{

if BT {

cout<<BT->data<<'';

}

}