int main() { struct node * head =list (7); struct node * head2 =list (4); print(head); printf("\n"); head=insertb(0,head); print(head); printf("\n"); head=eliminar(0,head); print(head); printf("\n"); head=inserto(head,8); print(head); printf("\n"); head=insertm(15,head); print(head); printf("\n"); concatenar(head,head2); print(head); return 0; }
int main() { int c; struct node *head; head=(struct node *)malloc(sizeof (struct node)); while(1) { printf("Enter a choice\n"); printf("1)Create:\n2)View:\n3)Insert Begining:\n4)Insert Specific:\n5)Insert End:\n6)Sort\n"); scanf("%d",&c); switch(c) { case 1: { create(head); break; } case 2: { view(head); break; } case 3: { insertb(head); break; } case 4: { inserts(head); break; } case 5: { inserte(head); } case 6: { sort(head); } } } return 0; }