Thread by @swapnakpanda

🗒 List of Data Structures Topics

Now learn and, master these easily.

⇩

We will break down for below

➊ Array
➋ Linked List
➌ Stack
➍ Queue
➎ Hash Table
➏ Heap
➐ Tree
➑ Graph

➊ Array

⬔ Types

➀ One-Dimensional Array
➁ Multi-Dimensional Array

⬓ Key Points

➀ Index

⬕ Algorithms

➀ Creating an Array
➁ Iterate through Array
➂ Get an Element
➃ Find an Element
➄ Insert Element(s)
➅ Delete Element(s)
➆ Filter an Array
➇ Fetch a Sub-Array
➈ Merging Arrays
➉ Reverse Array
➀➀ Rotate Array
➀➁ Sorting Array

➋ Linked List

⬔ Types

➀ Singly Linked List
➁ Doubly Linked List
➂ Circular Linked List

⬓ Key Points

➀ Node
➁ Next/Back Pointer

⬕ Algorithms

➀ Creating an Array
➁ Iterate through Array
➂ Get an Element
➃ Find an Element

➄ Insert Element(s)
➄.➀ At Start
➄.➁ At End
➄.➂ At Anywhere
➅ Delete Element(s)
➅.➀ From Start
➅.➁ From End
➅.➂ From Anywhere
➆ IsEmpty
➇ Merging Linked Lists
➈ Reverse Linked List
➉ Sorting Array
➀➀ Check for Cycles

➌ Stack

⬓ Key Points

➀ Last In First Out

⬕ Algorithms

➀ Push
➁ Pop
➂ IsEmpty
➃ IsFull
➄ Peek

➍ Queue

⬔ Types

➀ Queue
➁ Circular Queue
➂ Priority Queue
➃ Double Ended Queue (Deque)

⬓ Key Points

➀ First In First Out

⬕ Algorithms

➀ Enqueue
➁ Dequeue
➂ IsEmpty
➃ IsFull
➄ Peek

➎ Hash Table

⬓ Key Points

➀ Key
➁ Value

⬕ Algorithms

➀ Hashing/Hash Function
➀.➀ Division Method
➀.➁ Multiplication Method
➀.➂ Universal Hashing

➁ Hash Collision
➁.➀ Collision Resolution
➁.➁ Open Addressing
➁.➁.➀ Linear Probing
➁.➁.➁ Quadratic Probing
➁.➁.➂ Double Hashing

➏ Heap

⬔ Types

➀ Heap
➁ Fibonacci Heap

⬓ Key Points

➀ Heap Property
➁ Max Heap
➂ Min Heap

⬕ Algorithms

➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)

➐ Tree

⬔ Types

➀ Binary Tree
➁ Binary Search Tree
➂ AVL Tree
➃ B-Tree
➄ B+ Tree
➅ Red Black Tree
➆ Trie

⬓ Key Points

➀ Node
➁ Edge
➂ Forest
➃ Parent
➄ Child
➅ Sibling

⬕ Algorithms

➀ Traversal
➁ Height of a Node/Tree
➂ Depth of a Node
➃ Degree of a Node
➄ Insert
➅ Delete
➆ Get
➇ Search

➑ Graph

⬔ Types

➀ Directed Graph
➁ Undirected Graph

⬓ Key Points

➀ Vertices
➁ Edge
➂ Adjacency Matrix
➃ Adjacency List

⬕ Algorithms

➀ Add Node
➁ Delete Node
➂ Depth First Search
➃ Breadth First Search
➄ Find the shortest path
➅ Minimum Spanning Tree
➆ Graph Cycle
➇ Topological Sorting
➈ Backtracking
➉ Connectivity

End of 🧵

Do you find this one useful? Share your thoughts.

Here I am regularly sharing questions, cheat sheets, tips and, tutorials related to Web Development (HTML, CSS, JavaScript, React), Data Structures and Database.

Are you interested? To never miss any, Follow me ✅

* ignore the wrong mentions in the above tweet. Those should be meant like this:

⬕ Algorithms

➀ Creating a Linked List
➁ Iterate through Linked List

* ignore the wrong mention in the above tweet. That should be meant like this:

⬕ Algorithms

➉ Sorting a Linked List