Data Structures for Absolute Beginners in Python
- Description
- Curriculum
- FAQ
- Reviews
You’ll learn about the most important and basic data structures that every veteran programmer knows about in detail. By the end of the course, you’ll be able to implement these from absolute scratch.
The course is designed to help the students write their own code. Each module has explanation parts and implementation parts, you’re encouraged to implement an explained topic on your own.
Data Structures covered in the course.
-
Singly Linked Lists
-
Doubly Linked Lists
-
Stacks
-
Queues
-
Binary Search Trees
-
Graphs
-
Computational Complexity
Algorithms
-
Reversing a linked list
-
Recursive and iterative tree traversal
-
Breadth First Search
-
Depth First Search
Analysis
-
Big O notation
Who is this course for?
Many people learn programming and are told to learn data structures and algorithms to pass coding interviews and get jobs. This course is designed for an individual who has some python programming knowledge and wants to get better at it by learning data structures. Even if you have no python experience but know some other programming language, this can be a great chance to learn python. For people who don’t know python, this provides programming problems to get better at python.
How the course is designed
The course is designed with 7 major modules. We go from installing python, to setting up jupyter notebook to understanding and implementing data structures from scratch. We also visualize computational complexity of different operations we write for these data structures in the final section on computational complexity.
What will you get out of it
-
Better understanding of data structures.
-
More tools at your disposal for solving programming problems.
-
Ability to implement data structures from scratch in python.
-
Opportunity to practice python.
-
12Section IntroductionVideo lesson
-
13Introduction to Linked ListsVideo lesson
-
14Singly Linked List ImplementationVideo lesson
-
15Singly Linked List: Push MethodVideo lesson
-
16Singly Linked List: Unshift MethodVideo lesson
-
17Singly Linked List: Shift MethodVideo lesson
-
18Singly Linked List TraversalVideo lesson
-
19Singly Linked List PopVideo lesson
-
20Singly Linked List InsertVideo lesson
-
21Singly Linked List RemoveVideo lesson
-
22Singly Linked List ReverseVideo lesson
-
23Singly Linked Lists: ConclusionVideo lesson
-
24Section IntroductionVideo lesson
-
25Doubly Linked Lists: IntroductionVideo lesson
-
26Doubly Linked Lists: ImplementationVideo lesson
-
27Doubly Linked Lists: Push MethodVideo lesson
-
28Doubly Linked Lists: Unshift MethodVideo lesson
-
29Doubly Linked Lists: Shift MethodVideo lesson
-
30Doubly Linked Lists: Pop MethodVideo lesson
-
31Doubly Linked Lists: Insert MethodVideo lesson
-
32Doubly Linked Lists: RemoveVideo lesson
-
33Doubly Linked Lists: ReverseVideo lesson
-
34Doubly Linked Lists: ConclusionVideo lesson
-
35Section IntroductionVideo lesson
-
36Binary Search Trees: IntroductionVideo lesson
-
37Binary Search Trees: ImplementationVideo lesson
-
38Binary Search Trees: Insertion IntroductionVideo lesson
-
39Binary Search Trees: Insertion Implementation (Iterative)Video lesson
-
40Binary Search Trees: Insertion Implementation (Recursive)Video lesson
-
41Binary Search Trees: Preorder Traversal (Part 1)Video lesson
-
42Binary Search Trees: Preorder Traversal Part 2Video lesson
-
43Binary Search Trees: Inorder TraversalVideo lesson
-
44Binary Search Trees: Postorder TraversalVideo lesson
-
45Binary Search Trees: Delete ExplanationVideo lesson
-
46Binary Search Trees: Delete ImplementationVideo lesson
-
47Binary Search Trees: SearchVideo lesson
-
48Binary Search Trees: ConclusionVideo lesson
External Links May Contain Affiliate Links read more