various types of data structure you should know in 2023

Data structures is broadly classified into 2 categories: 1.Linear 2.Non linear

Arrays, linked lists, stacks, and queues are linear data structures whereas as Trees and graphs are non-linear data structures.

[{"selector":"#anim-8eb8ed69-2c58-4a22-9d60-4c3c7f67a129 [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-054b83fe-dc21-42c7-afa4-f2c639c599d9","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-19af1a99-820d-44c8-9c5a-4cbd10bf1cdd","keyframes":{"transform":["translate3d(0px, 139.28979%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Arrays, linked lists, stacks, and queues are linear data structures whereas as Trees and graphs are non-linear data structures.

[{"selector":"#anim-06027611-70c5-47d8-aae3-63695983faa6 [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-3a727853-6287-4d4d-91f0-307c316812ca","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-2e97a983-c4d9-4f3a-b0ca-56a2889496fd","keyframes":{"transform":["translate3d(0px, 139.28979%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

An array is a simple data structure that stores a fixed-size sequential collection of elements of the same type

[{"selector":"#anim-781e8d75-079d-49f3-970b-669f9802fdaf [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-3a3fc229-4a85-413e-8d34-83c8100df038","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-3e4949eb-f5ff-4c47-8342-7e51367c9eee","keyframes":{"transform":["translate3d(0px, 164.73431%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-63ee36b7-fc9c-4f82-a824-ce0054646f96","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-e24357b4-628b-4775-80e9-e56d5570feb0","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A stack is a linear data structure that follows the Last In, First Out (LIFO) principle

[{"selector":"#anim-2d9890d4-13a2-4356-b28c-8eabe0018481 [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-50f54170-fb6d-4583-9faa-b34a4bea14d6","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fbe9730a-952e-4da1-b57f-f17d04fcae04","keyframes":{"transform":["translate3d(0px, 200.95491%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-a9377427-ec92-4bea-ad74-59fe1ba07cb2","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c890c9c8-4cd7-4b23-b68b-aad5253d2295","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A queue is a linear data structure that follows the First In, First Out (FIFO) principle

[{"selector":"#anim-df52bc8c-e284-447f-b9ce-7aee6853db47 [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-8bea69c7-2e0f-42e8-becc-07855cfdb21f","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-37105db5-9546-41a5-9dd0-47785bf1f195","keyframes":{"transform":["translate3d(0px, 198.61114%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-74602e24-59ce-49e9-9b4a-e127a5c9b364","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-02b09cb5-1e23-4884-b652-387a5d77fe2d","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A linked list is a data structure that consists of a sequence of nodes, where each node stores a reference to an element and a reference to the next node

[{"selector":"#anim-f5a096fb-b785-425a-ac7a-eb91acd83968 [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-21e4e7f3-9dc4-481a-bb32-92e153f302fb","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-dffb6208-3e52-485c-8b47-6762da564ea9","keyframes":{"transform":["translate3d(0px, 125.31957%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-5e1497c2-bb24-420a-977a-cf36731d5264","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-4c0a99cc-e000-4eff-aef0-5b088440b0ae","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A tree is a non-linear data structure that consists of a root node and subtrees of children nodes

[{"selector":"#anim-0035a5de-f234-487a-b6dd-889cec686179 [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-7eba574b-30eb-4ab1-9018-972230dc1d25","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-4df80e95-5397-4484-ac90-3c6fb2e4262b","keyframes":{"transform":["translate3d(0px, 203.29867%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-6c5b8682-4c1b-409f-a4d5-db7ce4ddd96c","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-97939c03-40fb-4a9d-92f0-41f70cd9c5ce","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

A graph is a non-linear data structure that consists of a set of vertices (nodes) and a set of edges connecting them

[{"selector":"#anim-824c0ffa-32b3-47bd-85d2-2186676ceb3d [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-78d39b57-89a1-4a5c-b04b-335f5ecf67cb","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-2bf5b3bf-27c6-415f-941a-482e1e36ea77","keyframes":{"transform":["translate3d(0px, 169.70326%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-33756fd5-3a19-45a4-8033-d6e90923dcc9","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-22f7240f-24d7-4d00-a2f1-94d4f8bd0311","keyframes":{"transform":["translate3d(0px, 848.05585%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Things about data structure you should know

[{"selector":"#anim-bd6924b5-2baa-4ba4-bd1c-61bcdb93edfd [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-10a6affd-00f2-42fe-b45c-81dade013b27","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-9e6cf1f1-faf3-43fb-bdef-f703d9baa35b","keyframes":{"transform":["translate3d(0px, 304.05984%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Data structures is broadly classified into 2 categories: 1.Linear 2.Non linear

Arrays, linked lists, stacks, and queues are linear data structures whereas as Trees and graphs are non-linear data structures.

Arrays, linked lists, stacks, and queues are linear data structures whereas as Trees and graphs are non-linear data structures.

An array is a simple data structure that stores a fixed-size sequential collection of elements of the same type

Array

A stack is a linear data structure that follows the Last In, First Out (LIFO) principle

Stacks

A queue is a linear data structure that follows the First In, First Out (FIFO) principle

Queues

A linked list is a data structure that consists of a sequence of nodes, where each node stores a reference to an element and a reference to the next node

Linked lists

A tree is a non-linear data structure that consists of a root node and subtrees of children nodes

Trees

A graph is a non-linear data structure that consists of a set of vertices (nodes) and a set of edges connecting them

Graphs

Things about data structure you should know