Gammal Tech
Premium
Courses
Masterclass
FAQ
Contact
SIGN IN
My Account
Data Structures
Learn the skill of organizing data in the correct structures to speed up your programs and reduce storage usage.
Lesson
1
Recursion Part 1
Lesson
2
Recursion Part 2
Lesson
3
Recursion Part 3
Lesson
4
Recursion Part 4
Lesson
5
malloc() Part 1
Lesson
6
malloc() Part 2
Lesson
7
calloc()
Lesson
8
free()
Lesson
9
realloc()
Lesson
10
Implementing Vector
Lesson
11
Dynamic Memory Allocation
Lesson
12
Linked List 1
Lesson
13
Linked List 2
Lesson
14
Linked List Types
Lesson
15
Linked List (Recursion)
Lesson
16
Recursion Explanation
Lesson
17
Double Linked list
Lesson
18
Circular Linked List
Lesson
19
Double Circular Linked List
Lesson
20
Recursion 2 Explanation
Lesson
21
Memory Leak
Lesson
22
New & Delete
Lesson
23
Exception
Lesson
24
Destructor
Lesson
25
Linked List (C++)
Lesson
26
Delete Node
Lesson
27
Memory leak 2
Lesson
28
Stack 1
Lesson
29
Stack 2
Lesson
30
Stack 3
Lesson
31
Queue 1
Lesson
32
Queue 2
Lesson
33
Queue 3
Lesson
34
Deque 1
Lesson
35
Deque 2
Lesson
36
List
Lesson
37
Trees 1
Lesson
38
Trees 2
Lesson
39
Binary Search Tree 1
Lesson
40
Binary Search Tree 2
Lesson
41
Binary Search Tree 3
Lesson
42
BST Delete Node 1
Lesson
43
BST Delete Node 2
Lesson
44
Heap 1
Lesson
45
Heap 2
Lesson
46
Hash Function
Lesson
47
Hash Code
Lesson
48
How many letters?
Lesson
49
Hash Table 1
Lesson
50
Hash Table 2
Lesson
51
DS Summary