Sure, if you don’t mind the linked list having a maximum size, you could statically allocate an array of list nodes, and then use integer indices into the array as your “previous” and “next” values for each node, rather than pointers. I’ve done in this in the past to save a bit of memory (since … Read more
MATLAB has access to Java: >> a=java.util.LinkedList; >> li=a.listIterator; >> li.add(2); >> li.add(int8(77)); >> li.add(77); >> li.add(boolean(true)); >> li.add(‘Mr. Bill’); >> li.previous(); >> li.add([1 2 3 4 5]); >> a a = [2.0, 77, 77.0, true, [D@66a917, Mr. Bill] >> a.get(4) ans = 1 2 3 4 5 The one downside of this approach is … Read more
It is certainly not possible with a plain singly-linked list. Sketch proof: to examine the last node of a singly-linked list, we must perform n-1 operations of following a “next” pointer [proof by induction on the fact that there is only one reference to the k+1th node, and it is in the kth node, and … Read more
The problem is you are closing System.in (Scanner.close() closes the underlying stream). Once you do that, it stays closed, and is unavailable for input. You don’t normally want to do that with standard input: String searchedNode; Scanner in = new Scanner(System.in); System.out.println(“Enter the name you would like to remove from the list: “); searchedNode = … Read more
Say we have: Node1 -> Node2 -> Node3 -> Node4 -> Node5 To swap two nodes, you need to swap the next values of the ones before each of them, and also the next values of the nodes you want to swap. So to swap, say, Node2 and Node3, you effectively have to swap Node1->next … Read more
class Node { Object data; Node next; Node(Object d,Node n) { data = d ; next = n ; } public static Node addLast(Node header, Object x) { // save the reference to the header so we can return it. Node ret = header; // check base case, header is null. if (header == null) … Read more
If you are looking to better understand the basics of linked lists, take a look at the following document: http://cslibrary.stanford.edu/103/LinkedListBasics.pdf
I don’t believe it will be possible to get O(1) for both insertion and lookup. The minute you add an array (or even fancy, splittable vectors), the insertion becomes O(n). There are ways to mitigate the damage depending on the expected behavior of your list. If there will be a lot more lookups than insertions/deletions, … Read more
LinkedList is not thread safe. You’d have to do the locking yourself. Try ConcurrentLinkedQueue or LinkedBlockingDeque instead if it fits your needs, they are thread safe but slightly different behavior than LinkedList.
Vector is another name for dynamic arrays. It is the name used for the dynamic array data structure in C++. If you have experience in Java you may know them with the name ArrayList. (Java also has an old collection class called Vector that is not used nowadays because of problems in how it was … Read more