All you need to know

[{"selector":"#anim-a1669381-308c-4388-a577-847bd4fca772","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-832935e6-0631-44f7-b1c1-325cb0edd3f9","keyframes":{"transform":["translate3d(0px, -580.58141%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Types of Linked Lists

Introduction to Linked Lists

[{"selector":"#anim-1c29e8e6-0016-4d87-ae85-cd9495489233 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate3d(6.846869328454303%, 0, 0) translate(25%, 0%) scale(1.5)","translate3d(0%, 0, 0) translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.14,.34,.47,.9)","fill":"forwards"}] [{"selector":"#anim-581cf007-c039-49d0-910a-68af250035d0","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-9081c7be-a211-4109-b8f7-0572f7c6c7dc","keyframes":{"transform":["translate3d(0px, -273.40887%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-f0bb31c0-4e37-4223-adcf-d7173ca32dfc","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-edca5f9c-fbf3-4a52-a0f0-bf7a7ae9b09c","keyframes":{"transform":["translate3d(0px, -207.08065%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Linked lists are linear data structures comprised of linked nodes, each having corresponding data and a pointer to the next node's address. Learn More

Linked lists start with the Head, which acts as an access point, while the Tail marks the end of the list by pointing to NULL.

[{"selector":"#anim-071ae76d-a18c-4363-b55d-d8d8645d01c6","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b3b4c4bd-c4a2-469d-9493-beeb7e74ca2c","keyframes":{"transform":["translate3d(0px, -372.30159%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-dc9ca262-1b66-4ed1-abb2-eccee0763da9 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate3d(7.868525640762189%, 0, 0) translate(25%, 0%) scale(1.5)","translate3d(0%, 0, 0) translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.14,.34,.47,.9)","fill":"forwards"}] Learn More

Types of Linked Lists

[{"selector":"#anim-5f0d0314-76a8-4641-a598-d9b9b0fb6fe2","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-231a1790-e3bc-411f-8bb7-6f6c46fae2fe","keyframes":{"transform":["translate3d(0px, -283.11762%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-f127bdb3-75f2-4202-af12-9fda7791bdcd [data-leaf-element=\"true\"]","keyframes":{"transform":["translate3d(7.812499744007886%, 0, 0) translate(25%, 0%) scale(1.5)","translate3d(0%, 0, 0) translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.14,.34,.47,.9)","fill":"forwards"}] [{"selector":"#anim-2e436c16-b151-4a7e-a34a-b58f831c3a8f","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-1ed669a9-4019-4850-a113-84e81d75ff8b","keyframes":{"transform":["translate3d(0px, -207.08065%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fe3d82bc-695c-4cd8-9e8d-f099209a2140","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-7f2ef314-8e8e-4e1d-952d-93d354036877","keyframes":{"transform":["translate3d(0px, -1040.63492%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Each node is linked to its next node, so we can only traverse in one direction. It has 2 – Data part containing data & next part containing address of next node. Learn through example

2. Doubly Linked List

[{"selector":"#anim-7507cc7a-d48d-428c-ad14-f4e848080225","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-9b6318c0-09e8-4e3f-870a-a4991dcb4e7d","keyframes":{"transform":["translate3d(0px, -283.11762%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-897607a2-8aad-4a1f-b196-2dc8daede2d0 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate3d(7.812499744007886%, 0, 0) translate(25%, 0%) scale(1.5)","translate3d(0%, 0, 0) translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.14,.34,.47,.9)","fill":"forwards"}] [{"selector":"#anim-cb741c7f-122f-4d94-935a-20f66cdb2ae2","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b6742a78-d718-4fa5-8639-935b2eeb8ebc","keyframes":{"transform":["translate3d(0px, -1043.49219%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Since every node contains a previous pointer, we can traverse both directions. It has 3 parts- data part, pointer to next node and pointer to previous node. Learn through example

3. Circular Linked List

[{"selector":"#anim-c075568a-81fa-44d6-ba27-dacabbe225b1","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-2f441138-bfb8-480c-ba31-20b357de24df","keyframes":{"transform":["translate3d(0px, -228.75818%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-4e78d55f-d2cf-4c01-967c-557693a96f9b [data-leaf-element=\"true\"]","keyframes":{"transform":["translate3d(7.868525640762189%, 0, 0) translate(25%, 0%) scale(1.5)","translate3d(0%, 0, 0) translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.14,.34,.47,.9)","fill":"forwards"}] [{"selector":"#anim-798c084a-dc0d-466e-8575-67533d62a30a","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-e0188fd1-33b2-4611-8146-797907638378","keyframes":{"transform":["translate3d(0px, -1000.63495%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Since circular linked lists are circular, the last node on the list will be connected to the first node. It can be of 2 types- - Singly Circular Linked List - Doubly Circular Linked List Learn through example

“

[{"selector":"#anim-7909f7ca-95c3-4ee9-9dee-e4134a120c39","keyframes":{"opacity":[0,1]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-e54a30e2-0168-4efb-affb-932f7364329d","keyframes":{"transform":["translate3d(0px, -200.89605%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b7ce980c-8744-43d9-a3ef-75fbeaa76643","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-086b8950-c636-4987-8902-237593f4fce4","keyframes":{"transform":["translate3d(0px, -1772.06357%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Check out the algorithms and how these types are implemented in Java. SWIPE UP