About Course
This course, Data Structures, and Algorithms in python includes an explanation of various data structures with coding examples, provided with a detailed explanation of code side by side with concept building.
Most important Data Structures like
Linked List, Binary Search Tree, stack are explained in detail with concepts made easy to understand.
Algorithms like
Selection Sort, Insertion Sort is part of this course.
This course is for students who want a good understanding of data structures and algorithms and understand code.
By taking this course, students will be able to use these skills to write and understand data structures in other languages because concepts built from this course are very generic regarding Data structures and Algorithms.
Students can get this course to understand Algorithms and Data structures.
This course is about writing code, but there are more above codes that are “Explanation of working of Algorithms” when you understand how it’s working, then it’s easy to get a grip over Algorithms and Data Structures.
Data Structures and Algorithms in Python.
Who this course is for:
 Students who want to make strong concepts in Data Structures
 Learn Algorithms like selection sort and insertion sort
 Students who want to learn data structures and algorithms using python should take this course.
Course Content
Data Structures and Algorithms In Python

data structure introduction
02:08 
Why need to use data structures
00:00 
differance between Data structures and abstract data types (ADT)
00:00 
how to install python
00:00 
Arrays introduction in python
00:00 
Arrays in Python
00:00 
Linked list in python
00:00 
Linked list operations in python
00:00 
doubly linked list in python
00:00 
linked lists vs arrays
00:00 
Linked list insertion implementation in python
00:00 
Linked list implementation in python (travese)
00:00 
Linked list implementation in python remove
00:00 
Linked list implementation testing in python
00:00 
Doubly linked list in python
00:00 
stack in python
00:00 
stack in memory
00:00 
stack and recursion
00:00 
stack implementation in python
00:00 
queue in python
00:00 
queue implementation in python
00:00 
binary search tree
00:00 
binary search treeinsert
00:00 
binary search treedelete in python
00:00 
binary search tree travesal in python
00:00 
binary search tree running time
00:00 
binary search tree in python (BST)
00:00 
binary search tree insertion in python (BST)
00:00 
binary search tree travercing in python (BST)
00:00 
binary search tree testing in python (BST)
00:00 
binary search tree deletion in python (BST)
00:00 
binary search tree testing in python (BST)
00:00 
AVL tree in data strcture python
00:00 
AVL tree rotation case
00:00 
AVL tree illutration
00:00 
AVL tree height balance implementation in python
00:00 
AVL tree violance implementation in python
00:00 
AVL tree introduction
00:00 
AVL tree rotation implementation in python
00:00 
AVL tree application
00:00 
AVL tree height introduction
00:00 
AVL tree remove implementation in python
00:00 
AVL tree node implementation in python
00:00 
AVL tree insertion implementation in python
00:00 
priority queue in data structure
00:00 
heap in data structure
00:00 
heap using array in python
00:00 
heap remove operation
00:00 
heapsort in data structure
00:00 
heap operation complexicity
00:00 
binomial and fibonacci heap
00:00 
heap insertion in python
00:00 
hepsort in python
00:00 
heap implementation in python
00:00 
heap in python
00:00 
associted array in python
00:00 
hashtable in data structure
00:00 
hashtable collision
00:00 
hashfunction linear probing in python
00:00 
linear probing insert implemention in python
00:00 
linear probing retrieve emplementation in python
00:00 
dictionary in python
00:00 
triesternary search tree in data structure
00:00 
insertion in tries in data structurepython
00:00 
seaching in tries in data structurepython
00:00 
application in tries in data structure
00:00 
implementation of tries in python
00:00 
implementation of tries in python
00:00 
logic of red black tree in data structure
00:00 
red black tree in data structure
00:00 
red black tree rotations1 in data structure
00:00 
red black tree rotations2 in data structure
00:00 
red black tree rotations3 in data structure
00:00 
red black tree rotations4 in data structure
00:00 
red black tree example in data structure
00:00 
red black tree example2 in data structure
00:00 
red black tree vs AVL tree in data structure
00:00 
graph in data structure
00:00 
breadth first search in data structure
00:00 
breadth first search implementation in python
00:00 
depth first search in data structure
00:00 
depth first search implementation in python
00:00 
BFS vs DFS in data structure
00:00 
dijkstra algorithms in data structure
00:00 
dijkstra algorithms logic in data structure
00:00 
dijkstra algorithms real time example
00:00 
dijkstra algorithms in python1
00:00 
dijkstra algorithms in python2
00:00 
dijkstra algorithms in python3
00:00 
bellman ford algorithms in data structure
00:00 
bellman ford algorithms in python1
00:00 
bellman ford algorithms in python2
00:00 
bellman ford algorithms in python3
00:00 
shortest path algorithms
00:00 
union find data structure
00:00 
spanning tree in data structure
00:00 
kruskal algorithms in python1
00:00 
kruskal algorithms in python2
00:00 
kruskal algorithms in python3
00:00 
kruskal algorithms in python4
00:00 
spims algorithms in data structure
00:00 
prims algorithms in python1
00:00 
prims algorithms in python2
00:00 
prims algorithms in python3
00:00 
application of spanning tree
00:00 
sorting algorithms in data structure
00:00 
Adaptive sorting algorithms
00:00 
Bubble sort in data structure
00:00 
Bubble sort in python
00:00 
Selection sort in data structure
00:00 
Selection sort in python
00:00 
Quicksort introduction I
00:00 
Insertion sort in python
00:00 
Insertion sort in data structure
00:00 
Quicksort introduction II
00:00 
Quicksort in python
00:00 
Merge sort importance in data structure
00:00 
Merge sort in data structure
00:00 
Merge sort in python
00:00 
Hybrid sorting algorithms
00:00 
Non comparison sorting algorithms
00:00 
Counting sort in data structure
00:00 
Radix sort in data structure
00:00