Familiarize Yourself with different types of linked list in 2023

There are several types of linked lists, a few of them are:

A list in which each node has a reference to the next node in the list, but not the previous node

[{"selector":"#anim-bc64fba6-c392-4fcd-9f19-e98478cc2a25 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-2e4ae1c4-f97e-437f-9c69-c3f1b20d6874","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-8c06b91c-cc63-4a8b-9aa8-94681ba006a5","keyframes":{"transform":["translate3d(-115.18988%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fb65734d-8fc4-4b65-9253-f56cb9067140","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b1d0ad42-f317-4266-9e62-543dda0f9c0c","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A list in which each node has a reference to both the next and previous nodes in the list

[{"selector":"#anim-e5812ba9-edb0-40e2-b526-6fc797fc85db [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-b07eb2a8-eb6c-4d84-87d0-0ac59fee6d3f","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c8739bf4-6079-4e49-bfc6-66c848e94236","keyframes":{"transform":["translate3d(-115.18988%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c44a2d4f-483c-4457-b13b-057a035bd0ce","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c59ac79b-4965-459f-96f8-e026af6f63e9","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

a list in which the last node has a reference to the first node, creating a circular structure.

[{"selector":"#anim-74f3c0ba-3512-4a32-af60-753a0fd28fd5 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-4f32fc75-e8ad-4dfa-869d-95f1f2f5d492","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-a8bc06d0-31c2-44f8-94c5-0a59ba9c035e","keyframes":{"transform":["translate3d(-115.18988%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-dc653823-d672-4c58-bf8d-9a4f40c0ad6f","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-d2d69d12-ae4b-425f-97c5-2610ce14e127","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A list in which each node has a reference to the next node in the list, but the reference is the result of an exclusive-OR (XOR) operation

[{"selector":"#anim-5799278a-1ed0-439e-ad3b-48ff0901dd18 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-b46d1e58-41bf-4ea7-a8eb-bfbd3d3f8678","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-1b16bc3d-6877-454c-9c4e-4ae1d1607c10","keyframes":{"transform":["translate3d(-115.18988%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-25e16cf5-8378-42b1-977c-74441914f506","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-80a3637a-0c84-478c-81cf-e34db34e334a","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A list in which multiple elements are stored in each node, reducing the number of nodes and references required

[{"selector":"#anim-5ec5dee0-8cc8-4aca-9874-659a1ad1d6de [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-de8bdfdb-384c-47cf-b8d8-2775953c0a95","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-079c48f8-d32d-4adc-bd80-b73dcc3d24ff","keyframes":{"transform":["translate3d(-115.18988%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-0c808f05-e952-49ed-9697-1b6771f89619","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-bc8d2c70-1edf-4b35-809e-870c05de8e1b","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Familiarize Yourself with the basic of a linked list

[{"selector":"#anim-8e53d9e3-5f77-40fd-9a36-98e89903bea3 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-faec8814-b6ec-4434-a789-eb9d70766442","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-3e7f1908-fadf-4673-bb89-7c7490865ca0","keyframes":{"transform":["translate3d(-115.50632%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

There are several types of linked lists, a few of them are:

A list in which each node has a reference to the next node in the list, but not the previous node

Singly-linked list

A list in which each node has a reference to both the next and previous nodes in the list

Doubly-linked list

a list in which the last node has a reference to the first node, creating a circular structure.

Circularly-linked list

A list in which each node has a reference to the next node in the list, but the reference is the result of an exclusive-OR (XOR) operation

XOR linked list

A list in which multiple elements are stored in each node, reducing the number of nodes and references required

Unrolled linked list

Familiarize Yourself with the basic of a linked list