链表插入算法LinkList ListInsert_L ( LinkList L,int i, Elemtype newnode ){ LinkList p = L; LinkList s; int j = 0; while ( p && j < i-1 ) { p = p->next; j++; } if ( !p ‖ j >i-1 ) { printf(“位置小于1或大于表长。\n ”); return L ; } s = (LinkList) molloc (sizeof ( LNode )); s->data = newnode; ______ ; ______ ; return L;}