private void insertAfter(Node item) {
			item.prev = this;
			item.next = next;

			if (this.next == null) {
				tail = item;
			}
			else {
				this.next.prev = item;
			}
			this.next = item;
		}
Insert a node as a successor to this node in the linked list

NOTE: Called only after the node is inserted into the tree
Ghidra/Framework/Generic/src/main/java/ghidra/generic/util/datastruct/TreeValueSortedMap.java