Bootcamps
Masterclasses
Menu
Courses
Account
Login / Sign Up

Data Structures Tutorial | Data Structures Tutorial For Beginners

Data structures are an integral part of understanding computer programming and software development, so learning the basics is critical for anyone starting out on their programming journey. Learn Data structure tutorials from basic to advanced concepts.

82 lessons 30 units 33 hr 43 min of reading Free
Data Structures Tutorial | Data Structures Tutorial For Beginners
1 problems 12 1 hr 16 min
2 Comparisons Explains comparing technologies and tools. 2 16 min
3 Abstract Covers abstract classes and methods in programming. 1 56 min
4 Non Linear Explains non-linear data structures like trees and graphs. 1 42 min
5 Binary Tree Explains binary trees and their operations. 3 1 hr 15 min
6 Roadmaps Covers career roadmaps for tech roles. 1 28 min
7 Basics Provides an overview of basic programming concepts. 2 24 min
8 Quick Guide Provides a quick guide to technologies. 1 37 min
9 Queue Describes the queue data structure with FIFO operations. 4 3 hr 36 min
10 Tree Introduces tree data structures and their operations. 6 3 hr 48 min
11 Linked List Explains linked lists, their types, and operations. 5 3 hr 52 min
12 Sorting Algorithms Covers sorting techniques like bubble sort and quicksort. 13 4 hr 21 min
13 sorts & algorithms Covers various sorting and algorithmic techniques. 1 5 min
14 Binary Search Covers binary search for efficient searching in sorted data. 3 41 min
15 Sorting Algorithm Covers sorting techniques like quicksort and mergesort. 3 2 hr 24 min
16 Interview Explains general interview techniques. 2 1 hr 6 min
17 Array Covers arrays, their properties, and operations. 4 59 min
18 Arrays Explains arrays in programming. 3 1 hr 27 min
19 B-Tree Covers B-Trees for balanced tree storage. 1 12 min
20 Data Structures Basics Introduces fundamental data structures like arrays and trees. 1 26 min
21 Recursion Explains recursive functions in C. 1 11 min
22 Searching Algorithms Explains algorithms like linear and binary search. 3 42 min
23 Big O Notation Explains Big O notation for analyzing algorithm efficiency. 1 7 min
24 Stack Covers the stack data structure with LIFO operations. 1 1 hr 27 min
25 Heap Explains heap data structures for priority queues. 1 23 min
26 Linear Search Describes linear search for finding elements in data. 1 15 min
27 Hashing Explains hashing for efficient data retrieval. 2 46 min
28 Graph Covers graph data structures and their applications. 1 20 min
29 BFS Explains Breadth-First Search for graph traversal. 1 33 min
30 Divide and Conquer Algorithm Covers divide-and-conquer strategies for algorithms. 1 8 min