The addition and subtraction versions of these data structures are variations on the esoteric X-OR type, which reduces storag
The addition and subtraction versions of these data structures are variations on the esoteric X-OR type, which reduces storage space at the expense of making them incompatible with garbage collectors. They are used in parallel in a "skip" data structure, while each element contains an array in their (*) unrolled version. Algorithms on these data structures can be simplified by using sentinel nodes to provide every element a previous and next node. They can optionally provide a reference from their tail to their head. For 10 points, name this data structure coming in circular and double varieties, whose name suggests the connection between each data record.
The addition and subtraction versions of these data structures are variations on the esoteric X-OR type, which reduces storage space at the expense of making them incompatible with garbage collectors.
{linked list}