struct
// FILL IN THE BLANKS (LINKED-LISTS CODE) (C++)
#include<iostream>
using namespace std;
struct ________ {
int data ;
struct node *next;
};
node *head = ________;
node *createNode() { // allocate a memory
node __________;
temp = new node ;
return _______ ;
}
void insertNode(){
node *temp, *traverse;
int n;
cout<< "Enter -1 to end "<<endl;
cout<< "Enter the values to be added in list"<<endl;
cin>>n;
while(n!=-1){
temp = createNode(); // allocate memory
temp->data = ________;
temp->next = ________;
if ( ___________ == NULL){
head = _________;
}
else {
traverse = ( );
while (traverse->next != ________{
traverse = traverse-> ___________;
}
traverse->next= temp;
}
cout<<"Enter the value to be added in the list"<<endl;
cin>>n;
}
}
void printlist(){
node *traverse = head; // if head == NULL
while (traverse != NULL) {
cout<<traverse->data<<" ";
traverse = traverse->next;
}
}
int main(){
int option;
do{
cout<<"\n =============== MAIN MENU ===============”<<endl
cout << "1. Create a List " << endl;
cout << "2. Print List" << endl
cout << "Exit" << endl;
cin>> ________;
switch(option){
case 1: _______________;
break;
case 2: _______________;
break;
case 3: _______________;
}
} while (option != ________ );
}
Step by step
Solved in 2 steps
