linked-list

I have two linked lists representing the digits of decimal numbers in order from most- to least-significant. for eg 4->7->9->6 and 5->7 The answer should be 4->8->5->3 without reversing the lists because reversing the lists would result in decrease of efficiency. I am thinking of solving the problem using stack.I will traverse both the lists and push the data elements into two separate stacks.One for each linked list.Then I pop both the stacks together and add both the elements and if the result is a two digit no I 10 modulo it and store the carry in a temp variable.The remainder is stored in

Which way gives the faster enqueueing and dequeuing when I have to insert very few elements, Is array better than a linked list? I need to insert few element and I have to remove and read that removed element from queue. If it is array I may have to modify the indexes every time I remove an element. Inserting and deleting may happen simultaneously also. Which one is better from below case? typedef struct{ mylist list; struct mylistQ *next; }mylistQ; Array Code static mylist myListQ[QUEUESIZE+1]; int qLast = 0; void enqueue_element(mylist qItem) { myListQ[qLast] = qItem; qLast++; } mylist

typedef struct item { char *text; int count; struct item *next; }; So I have this struct with nodes defined as above, but Im getting the error below and Im not able to figure out whats wrong. warning: useless storage class specifier in empty declaration }; I'm not sure, but try like that : typedef struct item { char *text; int count; struct item *next; }item; The typedef is useless because you didn't give it a name. You cannot use the typedef in any way. That's why you get a warning, because the typedef is useless. The struct is actually still usable without the warning if you remove the

In Java, there is a generic class called "Object", in which all classes are a subclass of. I am trying to make a linked list library (for a school project), and I have managed it to make it work for only one type, but not multiple, so is there anything similar to that? EDIT: I would post the code, but I don't have it on me at this time. There's no generic base class in C++, no. You can implement your own and derive your classes from it, but you have to keep collections of pointers (or smart pointers) to take advantage of polymorphism. EDIT: After re-analyzing your question, I have to point out