linked-list

So I thought I understood how to implement an array of pointers but my compiler says otherwise =(. Any help would be appreciated, I feel like I'm close but am missing something crucial. 1.) I have a struct called node declared:. struct node { int num; node *next; } 2.) I've declared a pointer to an array of pointers like so: node **arrayOfPointers; 3.) I've then dynamically created the array of pointers by doing this: arrayOfPointers = new node*[arraySize]; My understanding is at this point, arrayOfPointers is now pointing to an array of x node type, with x being = to arraySize. 4.) But when I

I was asked this question in some interview. I was required to write code for finding junction in a linked list (which is in form of Y with both arms not necessarily equal) for production environment in O(1) space and linear time. I came up with this solution (which i had previously seen somewhere) : 1. Measure lengths of both lists, let them be l1 and l2 2. Move the pointer of larger list by |(l1-l2)|. 3. Now move together both the pointers, if they point to same location, that is the junction. Interviewer: How will your code handle ? Case 1. The Y-format linked list has loop in the end after

I have following piece of code for reversing the linked list. I am getting confused in while loop and so would certainly appreciate if someone can provide visual explanation of how actually it's working. static void Reverse (struct node** headRef) { struct node* result = NULL; struct node* current = *headref; struct node* next; while(current != NULL) { next = current->next; current->next = result; result = current; current = next; } *headRef = result; } OK, here's my attempt to make valya's answer even clearer (though I thought it was pretty good already): Say we have this list: // a->b->c->d-

I came upon an interesting question and I am puzzled with the answer provided to me. The question is as follows: The concatenation of 2 lists can be performed O(1) time. Which of the following implementation of list should be used? - Singly Linked List - Doubly Linked List - Circular Linked List - Array Implementation Of Linked List I initially thought that a DLL would be the correct choice as concatenation can happen from both side, however the answer seems to CLL. I am confused. Any explanation will be most helpful. Thanks. You can easily concatenate two lists in O(1) time using either a

I was reading up on the two different ways of implementing a stack: linked list and dynamic arrays. The main advantage of a linked list over a dynamic array was that the linked list did not have to be resized while a dynamic array had to be resized if too many elements were inserted hence wasting alot of time and memory. That got me wondering if this is true for C++ (as there is a vector class which automatically resizes whenever new elements are inserted)? It's difficult to compare the two, because the patterns of their memory usage are quite different. Vector resizing A vector resizes itself

This question already has answers here : Java 1.6: Creating an array of List<T> (4 answers) I tried to define an array of linked list in Java like the following, which compiled fine but it generated 2 warning messages. LinkedList<Long> [] hashtable = new LinkedList[10]; warning: [rawtypes] found raw type: LinkedList LinkedList<Long> [] hashtable = new LinkedList[10]; ^ missing type arguments for generic class LinkedList<E> where E is a type-variable: E extends Object declared in class LinkedList HashTable.java:13: warning: [unchecked] unchecked conversion LinkedList<Long> [] hashtable = new

I have a table of items that need to be displayed in a certain order, but that order can be changed. Items can be added at the beginning, end, or in the middle, and items can be rearranged. How can I set up the table to keep track of that order in such a way that it's easy to modify but the list can also be fetched in order with a single query? For example, I could have a "NEXT_ID" column to do it linked list-style, but then how would I run a SELECT query to get the rows in order of the NEXT_ID chain? Apologies in advance for the super-obvious solution I'm probably missing. I have this problem

Excuse my ignorance but I am beginning to prepare for my first technical interview and came across this question and answer on the topic linkedlist Question: Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node public static boolean deleteNode(LinkedListNode n) { if (n == null || n.next == null) { return false; // Failure } LinkedListNode next = n.next; n.data = next.data; n.next = next.next; return true; } I want to start playing with this code (making changes compile test) but I'm not sure how to start doing this in Java. I cannot find

I have been asked in an interview how to count the number of nodes in a linked list without traversing the list? Is there any way to achieve this? The only way I can think of is to add a counter of the number of nodes which is incremented each time the add or insert methods are invoked, and decremented when delete is invoked. You cannot make assumptions about memory occupied because, being a linked list, you cannot guarantee that all nodes will be in the same memory block (indeed, this is highly improbable). If you are doing allocation dynamically with something like malloc then there is no