THE IGKNIGHT Docs

LEARN · BUILD · PRACTICE

Fullstack HTML CSS JavaScript Advanced JavaScript Python Java Advanced Java TypeScript React .NET C# Quality Testing Vue Data Structures Software Architecture

Topics

Data Structures Tutorials

Browse 152 Data Structures lessons with practical explanations and examples. Choose a topic to start learning.

1.Introduction to Data Structures
2.Types of Data Structures
3.Linear vs Non-Linear Data Structures
4.Static vs Dynamic Data Structures
5.Abstract Data Types (ADT) Explained
6.Time Complexity in Data Structures
7.Space Complexity in Data Structures
8.Big O Notation: Time and Space Complexity
9.Complexity Analysis of Data Structures
10.Arrays in Data Structures: Introduction
11.Array Operations in Data Structures
12.Array Traversal with Examples
13.Array Insertion: How to Insert Elements
14.Array Deletion: How to Delete Elements
15.Updating Elements in an Array
16.Searching in Arrays
17.Linear Search Algorithm
18.Binary Search: Algorithm and Examples
19.Sorting Arrays: Techniques and Algorithms
20.Two-Dimensional Arrays Explained
21.Multidimensional Arrays in Data Structures
22.Dynamic Arrays: How They Work
23.Strings in Data Structures: Introduction
24.String Operations and Manipulation
25.String Traversal with Examples
26.String Searching Techniques
27.String Manipulation Techniques
28.Character Frequency Counting
29.How to Reverse a String
30.Palindrome Strings: Check and Solve
31.String Anagrams: Concepts and Examples
32.Linked List Data Structure: Introduction
33.Singly Linked List Explained
34.Linked List Nodes and Structure
35.Linked List Traversal with Examples
36.Linked List Insertion Operations
37.Linked List Deletion Operations
38.Searching in a Linked List
39.How to Reverse a Linked List
40.Doubly Linked List Explained
41.Circular Linked List Explained
42.Detect a Cycle in a Linked List
43.How to Merge Linked Lists
44.Stack Data Structure: Introduction
45.Stack Operations: Push, Pop and Peek
46.Implement Stack Using an Array
47.Implement Stack Using a Linked List
48.Applications of Stack Data Structure
49.Balanced Parentheses Using Stack
50.Expression Evaluation Using Stack
51.Infix, Prefix and Postfix Expressions
52.Monotonic Stack Data Structure
53.Queue Data Structure: Introduction
54.Queue Operations: Enqueue and Dequeue
55.Implement Queue Using an Array
56.Implement Queue Using a Linked List
57.Circular Queue Data Structure
58.Deque Data Structure Explained
59.Priority Queue Data Structure
60.Applications of Queue Data Structure
61.Hashing in Data Structures: Introduction
62.Hash Table Data Structure Explained
63.Hash Functions Explained
64.Hashing Collisions and How They Work
65.Hashing Collision Handling with Chaining
66.Open Addressing in Hash Tables
67.Linear Probing in Hash Tables
68.HashMap Data Structure Explained
69.HashSet Data Structure Explained
70.Frequency Counting Using Hashing
71.Tree Data Structure: Introduction
72.Tree Data Structure Terminology
73.Properties of Tree Data Structures
74.Binary Tree Data Structure Explained
75.Tree Traversal: Complete Guide
76.Inorder Tree Traversal
77.Preorder Tree Traversal
78.Postorder Tree Traversal
79.Level Order Tree Traversal
80.Binary Search Tree (BST) Explained
81.Searching in a Binary Search Tree
82.Binary Search Tree Insertion
83.Binary Search Tree Deletion
84.Balanced Trees in Data Structures
85.AVL Tree Data Structure Explained
86.AVL Tree Rotations Explained
87.Red-Black Tree Data Structure
88.Heap Data Structure: Introduction
89.Min Heap Data Structure
90.Max Heap Data Structure
91.Heap Properties and Structure
92.Heap Operations: Insert, Delete and Peek
93.Heapify: Build and Maintain a Heap
94.How to Build a Heap
95.Heap Sort Algorithm Explained
96.Priority Queue Using Heap
97.Graph Data Structure: Introduction
98.Graph Data Structure Terminology
99.Directed vs Undirected Graphs
100.Weighted vs Unweighted Graphs
101.Graph Representation Techniques
102.Graph Adjacency Matrix Explained
103.Graph Adjacency List Explained
104.Breadth-First Search (BFS) Algorithm
105.Depth-First Search (DFS) Algorithm
106.BFS vs DFS: Differences and Use Cases
107.Connected Components in Graphs
108.Cycle Detection in Graphs
109.Topological Sorting in Graphs
110.Shortest Path Algorithms in Graphs
111.Dijkstra's Algorithm Explained
112.Minimum Spanning Tree: MST Explained
113.Trie Data Structure: Introduction
114.How to Implement a Trie Data Structure
115.Trie Insert, Search and Delete Operations
116.Applications of Trie Data Structure
117.Disjoint Set Data Structure
118.Union-Find Data Structure Explained
119.Path Compression in Union-Find
120.Union by Rank in Disjoint Set
121.Segment Tree Data Structure
122.Fenwick Tree (Binary Indexed Tree)
123.Range Query Data Structures
124.B-Tree Data Structure Explained
125.B+ Tree Data Structure Explained
126.Data Structures in JavaScript
127.Arrays in JavaScript
128.Stack Implementation in JavaScript
129.Queue Implementation in JavaScript
130.Data Structures in Python
131.Python Lists as a Data Structure
132.Python Dictionary Data Structure
133.Python Set Data Structure
134.Data Structures in Java
135.ArrayList in Java
136.HashMap in Java
137.HashSet in Java
138.Data Structures in C#
139.List in C#
140.Dictionary in C#
141.HashSet in C#
142.Data Structures Interview Questions
143.Array Interview Questions
144.Linked List Interview Questions
145.Stack Interview Questions
146.Queue Interview Questions
147.Tree Data Structure Interview Questions
148.Graph Interview Questions
149.Data Structures Problem-Solving Approach
150.How to Choose the Right Data Structure
151.Data Structure Complexity Comparison
152.Common Data Structure Problems and Patterns

🎨 IgKnight Docs

Master HTML, CSS, JS, Python, .NET and more with easy-to-follow lessons and practical code examples.

© 2025 IgKnight Learning Platform. All rights reserved.