Untitled
plain_text
3 days ago
1.5 kB
1
Indexable
Never
void main() { Node* head = NULL; int arr[] = {1,2,3,4,5,6,7,8,9,10}; fromArray(&head, arr, 10); int status = 0; int index,number; while (1){ printf("pushBack - 1, insert - 2, delete - 3, printList - 4, addFirstNumber - 5\n"); scanf("%d",&status); switch(status){ case 1: printf("Enter your number:\n"); scanf("%d",&number); pushBack(head,number); break; case 2: printf("Enter your index:\n"); scanf("%d",&index); printf("Enter your number:\n"); scanf("%d",&number); if (index >= GetSize(head) || index < 0){ printf("Error, wrong index.\n"); }else{ insert(head,index,number); } break; case 3: printf("Enter your index:\n"); scanf("%d",&index); if (index > GetSize(head) || index < 0){ printf("Error, wrong index.\n"); }else{ deleteNth(&head,index); } break; case 4: printLinkedList(head); break; case 5: printf("Enter your number:\n"); scanf("%d",&number); push(&head,number); break; default: printf("Bye bye!"); return 0; } } deleteList(&head); getch(); }