Write the programs for Linked List (Insertion and Deletion)
operations
Answer Posted / bhargav
In Answer 1 i think there is error in dellast()
void dellast()
{
node *temp,*cur=head;
while(cur->next->next!=NULL) -------> error
{
cur=cur->next;
}
temp=cur->next;
cur->next=NULL;
printf("Deleted item is %d\n",temp->item);
free(temp);
}
| Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
What are the major data structures used in the network data model?
Which interfaces are implemented by concurrentskiplistset?
What are the collision resolution methods?
Which sorting does collections sort use?
Which sorting algorithm uses minimum number of swaps?
What is the method to find the complexity of an algorithm?
How do you sort in ascending order in arraylist?
Which process places data at the back of the queue?
What exactly is data?
How is bubble sort done?
What is red black tree in data structure?
What are the Differences between map and hashmap?
What does it mean to sort an array?
Which is best book for data structures?
How do you represent a linked list?