linked-list

Basically I have 2 linked list here: list and distinct. There are a few set of words which have been saved earlier into the 'list' struct. Was gonna write a program that is gonna find the words that are distinct/unique and save it into the 'distinct' struct. Here is what I got so far based on my concept on pointers. However when I try to print 'distinct', the program crashes :( please correct me if I'm wrong. struct list { char string[50]; struct list *next; }; struct distinct { char string[50]; struct distinct *next; }; void checkdistinct() { list *ori = NULL; distinct *copy = NULL; distinct

I wanted to merge two sorted link lists by pointer manipulation, but stuck at this point. cant find out the mistake. Help me please. I think the problem is in while loop. I want to make it space efficient and do not want to make another list. #include<iostream> #include<conio.h> using namespace std; struct s { int info; s *next; }; int main() { int i; char choice = 'y'; s *ptr1, *ptr2, *start1, *start2, *reversedHead, *temp; ptr1= new s; start1=ptr1; cout<<"SIZE OF A NODE IS "<<sizeof(s)<<" BYTES"<<endl<<endl; while(choice=='y') { cout<<"Enter info for node: "; cin>>i; ptr1->info = i; cout<<

Could you please help me debug this code to swap two node of double link list? I am not able to figure out what i am doing wrong :( here is the code: dll* swap_node(dll *head , dll *node1 , dll *node2) { dll *tmp; int flag=0; if(node1->prev!=NULL) { node1->prev->next=node2; } else { flag=1; } if(node1->next!=NULL) { node1->next->prev=node2; } if(node2->prev!=NULL) { node2->prev->next=node1; } if(node2->next!=NULL) { node2->next->prev=node1; } tmp=node1->next; node1->next=node2->next; node2->next=tmp; tmp=node1->prev; node1->prev=node2->prev; node2->prev=tmp; if(flag==1) { head=node2; } return

Trying to do it through a loop that traverses through the list. In the loop I'm feeding the head node into a sorting function that I have defined and then I'm using strcmp to find out if which name in the node should come first. It is not working because writing the names too early. Im comparing them all linearly by going down the list one node at a time and not going back to see if the first should come before the last. That part explained would be helpful. The two functions that are most important to me now are defined as follows: I have tried my best to do what I think is right for the

To start with, yes, this is for an assignment in class, but my lack of understanding on how it operates is higher than I want it to be. We were given 3 classes, they are the following: SLinkedList.java package chapter3.linkedList; public class SLinkedList<V> { // instance variables. Add the tail reference. protected Node<V> head, tail; protected long size; // methods, empty list constructor first public SLinkedList () { head = null; tail = null; size = 0; } // end constructor of a SLinkedList // method to add nodes to the list. Storage space for the node // is already allocated in the calling