Data Structure & Algorithms Course
- Buy now
- Learn more
intoduction

1- about the course
2- what is data and memory final
3- what is data strucutre
4- what is algorithm
5- replit
آلية الإنضمام الى مجتمع سكربترز
كيفية الحصول على الأكواد المستخدمة في الدورة
Array

6- intro array and access
7- access implementation
8- search and implementation and explain
9- array insert intro
10- array insert implementation
11- array insert code explain
12- array delete introduction
13- array delete implementation
14- array delete code explain
15- refactor array code
16- array implementation typescript
17- array implementation java
18- array implementation python
19- array implementation c++
شارك رأيك معنا
2D Array

20- 2d array introduction
21- 2d array implementation
22- 2d array explain the code
23- 2d array implementation C#
24- 2d array implementation typescript
25- 2d array implementation python
26- 2d array implementation c++
Time Complixety

27- time complexity
28- space complexity
29- array time complexity
Singly Linked List

30- intro to singly linked list
31- singly linked list implementation part 1
32- singly linked list implementation part 2
33- singly linked list implementation part 3
34- singly linked list implementation part 4
35- singly linked list code explain
36- singly linked list complexity
37- singly linked list java implementation
38- singly linked list typescript implementation
40- singly linked list c++ implementation
39- singly linked list python implementation
Doubly Linked List

41- intro to doubly linked list
42- doubly linked implementation part 1
43- doubly linked implementation part 2
44- doubly linked implementation part 3
45- doubly linked implementation part 4
46- doubly linked code explain
47- doubly linked list java implementation
48- doubly linked list typescript implementation
49- doubly linked list c++ implementation
50- doubly linked list python implementation
Circular Singly Linked List

51- circular singly linked list introduction
52- circular singly linked list insert at front implementation
53- circular singly linked list insert at front explain
54- circular singly linked list insert at end implementation and explain
55- circular singly linked list print explain
56- circular singly linked list get node implementation and explain
57- circular singly linked list insert after , get last , get first implementation and explain
58- circular singly linked list delete node implementation and explain
59- circular singly linked list complexity
60- circular singly linked list java implementation
61- circular singly linked list typescript implementation
62- circular singly linked list c++ implementation
63- circular singly linked list python implementation
Circular Doubly Linked List

64- circular doubly linked list intro
65- circular doubly linked list insert at front
66- circular doubly linked list insert at end , print
67- circular doubly linked list insert after , get node implementation
68- circular doubly linked list delete node implementation
69- circular doubly linked list delete node and complexity explain
Array Based Stack

Array Based Stack Introduction
Array Based Stack implementaion - Part 1
Array Based Stack Code Explain part 1
Array Based Stack Implementation - part 2
Array Based Stack Code Explain - part 2
Array Based Stack Implementation - Typescript
Array Based Stack Implementation - Java
Array Based Stack Implementation - c++
Array Based Stack Implementation - python
Linked List Based Stack

LinkedList Based Stack Introduction
LinkedList Based Stack Implementation - Part 1
LinkedList Based Stack Code Explain - Part 1
LinkedList Based Stack Implementation - Part 2
LinkedList Based Stack Code Explain - Part 2
LinkedList Based Stack Implementation - Typescript
LinkedList Based Stack Implementation - Java
LinkedList Based Stack Implementation - c++
LinkedList Based Stack Implementation - python
Array Based Queue

Array Based Queue Introduction
Array Based Queue Implementation - Part 1
Array Based Queue Code Explain - Part 1
Array Based Queue Implementation - Part 2
Array Based Queue Code Explain - Part 2
Array Based Queue Implementation - Typescript
Array Based Queue Implementation - Java
Array Based Queue Implementation - Python
Array Based Queue Implementation - c++
LinkedList Based Queue

LinkedList Based Queue Introduction
LinkedList Based Queue Implementation - Part 1
LinkedList Based Queue Code Explain - Part 1
LinkedList Based Queue Implementation - Part 2
LinkedList Based Queue Code Explain - Part 2
LinkedList Based Queue Implementation - TypeScript
LinkedList Based Queue Implementation - Java
LinkedList Based Queue Implementation - Python
LinkedList Based Queue Implementation - C++
Tree

What is Recuresion
Introduction To Tree
Tree Types
Tree Traversal
Introduction To Binary Search Tree
Binary Search Tree Implementation - Part 1
Binary Search Tree Code Explain - Part 1
Binary Search Tree Implementation - Part 2
Binary Search Tree Code Explain - Part 2
Binary Search Tree Implementation - Part 3
Binary Search Tree Code Explain - Part 3
Binary Search Tree Implementation & Code Explain - Part 4
Binary Search Tree Implementation - Part 5
Binary Search Tree Code Explain - Part 5
Into To Algorithms

Algorithms Introduction
Selection Sorting Algorithm

Selection Sorting - Introduction
Selection Sorting - Implementation
Selection Sorting - Explanation
Buble Sorting Algorithm

Buble Sorting - Introduction
Buble Sorting - Implementation
Buble Sorting - Explanation
Insertion Sorting Algorithm

Insertion Sorting - Introduction
Insertion Sorting - Implementation
Insertion Sorting - Explanation
Merge Sorting Algorithm

Merge Sorting - Introduction
Merge Sorting - Implementation
Merge Sorting - Explanation
Quick Sorting Algorithm

Quick Sorting - Introduction
Quick Sorting - Implementation
Quick Sorting - Explanation
النهاية

نهاية الدورة

32- singly linked list implementation part 2

Lesson unavailable

Please login to your account or buy the course.