#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(" EMPTY LIST:");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == 'Y'||ans == 'y')
value = val;
newnode->next = NULL;
{return|come back|come" id="tip_27">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(" ----INSERTED----");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(" ----INSERTED----");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(" Inserted");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(" ----INSERTED----");
}
else
}
}
printf(" ---Sorted List---");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (
Solution
#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(" EMPTY LIST:");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == 'Y'||ans == 'y')
value = val;
newnode->next = NULL;
{return|come back|come" id="tip_27">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(" ----INSERTED----");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(" ----INSERTED----");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(" Inserted");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(" ----INSERTED----");
}
else
}
}
printf(" ---Sorted List---");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (

#include &lt;stdio.h&gt; #include &lt;malloc.h&gt; #define ISEMP.pdf

  • 1.
    #include <stdio.h> #include <malloc.h> #defineISEMPTY printf(" EMPTY LIST:"); /* * Node Declaration */ struct node ; snode* create_node(int); void insert_node_first(); void insert_node_last(); void insert_node_pos(); void sorted_ascend(); void delete_pos(); void search(); void update_val(); void display(); void rev_display(snode *); typedef struct node snode; snode *newnode, *ptr, *prev, *temp; snode *first = NULL, *last = NULL; /* * Main :contains menu */ int main() whereas (ans == 'Y'||ans == 'y') value = val; newnode->next = NULL; {return|come back|come" id="tip_27">come newnode; } }
  • 2.
    /* * Inserting Nodeinitially */ void insert_node_first() worker = first; initial = newnode; first->next = temp; } printf(" ----INSERTED----"); } /* * Inserting Node eventually */ void insert_node_last() printf(" ----INSERTED----"); } /* * Inserting Node at position */ void insert_node_pos() if (pos == 1) { if (first == last && initial == NULL) { initial = last = newnode; first->next = NULL; last->next = NULL; } else worker = first; initial = newnode; first->next = temp; }
  • 3.
    printf(" Inserted"); } else if(pos>1 && pos<=cnt) prev->next = newnode; newnode->next = ptr; printf(" ----INSERTED----"); } else } } printf(" ---Sorted List---"); for (ptr = first;ptr != NULL;ptr = ptr->next) if ( Solution #include <stdio.h> #include <malloc.h> #define ISEMPTY printf(" EMPTY LIST:"); /* * Node Declaration */ struct node ; snode* create_node(int); void insert_node_first(); void insert_node_last(); void insert_node_pos(); void sorted_ascend(); void delete_pos(); void search(); void update_val();
  • 4.
    void display(); void rev_display(snode*); typedef struct node snode; snode *newnode, *ptr, *prev, *temp; snode *first = NULL, *last = NULL; /* * Main :contains menu */ int main() whereas (ans == 'Y'||ans == 'y') value = val; newnode->next = NULL; {return|come back|come" id="tip_27">come newnode; } } /* * Inserting Node initially */ void insert_node_first() worker = first; initial = newnode; first->next = temp; } printf(" ----INSERTED----"); } /* * Inserting Node eventually */ void insert_node_last() printf(" ----INSERTED----"); }
  • 5.
    /* * Inserting Nodeat position */ void insert_node_pos() if (pos == 1) { if (first == last && initial == NULL) { initial = last = newnode; first->next = NULL; last->next = NULL; } else worker = first; initial = newnode; first->next = temp; } printf(" Inserted"); } else if (pos>1 && pos<=cnt) prev->next = newnode; newnode->next = ptr; printf(" ----INSERTED----"); } else } } printf(" ---Sorted List---"); for (ptr = first;ptr != NULL;ptr = ptr->next) if (