Zenler Player
Your course is loading. Hang tight.
Data Structures and Algorithms In Python (DSA Masterclass)
Back to curriculum
0% Complete
0% Complete
Data Structures and Algorithms In Python
Source Code Repository
Data Structures and Algorithms
Measuring Running time of Algorithms
Asymptotic Analysis
Big O Notation
Finding Big O
Tight and Loose Upper Bounds
Introduction Quiz A
Big O analysis of Algorithms
Finding Time complexity
Big O analysis of Algorithms: Examples
Worst case, Best case and Average Case Analysis
Common Complexities
Abstract Data Types
Introduction Quiz B
Introduction to Linked List
Traversing and Searching a Linked List
Finding references in a Single Linked List
Difference between while p is not None: and while p.link is not None:
Insertion in a Single Linked List
Insertion in a Single Linked List...contd
Deletion in a Single Linked List
Reversing a Single Linked List
Linked List Quiz A
Sorting a Linked list using Bubble Sort
Merging of sorted Linked lists
Sorting a Linked list using Merge Sort
Finding and Removing a cycle in a Linked list
Doubly Linked List
Insertion in a doubly linked list
Deletion from doubly linked list
Reversing a doubly linked list
Circular linked list
Insertion in a circular Linked List
Deletion in a circular linked list
Concatenation
Linked List with Header Node
Sorted linked list
Linked List Quiz B
Introduction
Stack
Array Implementation of Stack
Linked List Implementation of Stack
Queue
Array Implementation of Queue
Linked List implementation of Queue
Queue through Circular Linked List
Circular Queue
Deque
Priority Queue
Checking validity of an expression containing nested parentheses
Evaluating Arithmetic Expressions
Polish Notations
Converting infix expression to postfix expression
Evaluation of postfix expression
Stack and Queue Quiz
Introduction to trees
Binary Tree
Strictly Binary Tree and Extended Binary Tree
Full binary tree and Complete Binary Tree
Array Representation of Binary trees
Linked Representation of Binary Trees
Binary Tree Quiz A
Binary Tree in Python
Traversal in Binary Tree
Preorder Traversal
Inorder Traversal
Postorder Traversal
Level order traversal
Finding height of a Binary tree
Constructing Binary tree from Traversals
Constructing binary tree from inorder and preorder traversals
Constructing binary tree from inorder and postorder traversals
Binary Tree Quiz B
Introduction
Traversal in Binary Search Tree
Searching in a Binary Search Tree
Nodes with Minimum and Maximum key
Insertion in a Binary Search Tree
Deletion in a Binary Search Tree
Binary Search Tree Quiz
Introduction
Heap Representation
Insertion in Heap
Deletion
Building a heap
Heap Applications
Heap Tree Quiz
Introduction to Sorting Algorithms
Sort Stability
Selection Sort
Selection Sort : Example
Selection Sort in Python
Analysis of Selection Sort
Bubble Sort
Bubble Sort : Example
Bubble Sort in Python
Improvement in Bubble Sort
Analysis of Bubble Sort
Sorting Quiz A
Insertion Sort
Insertion Sort : Example
Insertion Sort in Python
Analysis of Insertion sort
Shell Sort
Shell Sort : Example
Shell Sort in Python
Analysis of Shell Sort
Merging two Sorted Arrays
Recursive Merge Sort
Recursive Merge Sort in Python
Analysis of Merge Sort
Iterative Merge Sort
Iterative Merge Sort in Python
Quick Sort
Quick Sort in Python
Analysis of Quick Sort
Binary tree sort
Binary Tree Sort in Python
Analysis of Binary Tree Sort
Heap Sort
Heap Sort : Python implementation and Analysis
Radix Sort
Radix Sort : Python implementation and Analysis
Sorting Quiz B
Linear Search
Linear Search in Sorted List
Binary Search
Implementation of Binary Search
Analysis of Binary Search
Direct Addressing
Hashing
Collisions
Hash Functions
Open Addressing : Linear Probing
Open Addressing : Quadratic Probing
Open Addressing : Double Hashing
Deletion in Open Addressed Tables
Implementation of Open Addressing
Separate Chaining
Implementation of Separate Chaining
Hashing Quiz
Introduction
Rotations
Insertion in AVL tree - 1
Insertion in AVL tree - 2
Insertion in AVL tree - 3
Insertion in AVL tree - 4
AVL Tree insertion cases
Examples of insertion in AVL Tree
Deletion in AVL Tree - 1
Deletion in AVL Tree - 2
Deletion in AVL Tree - 3
AVL Tree deletion cases
Examples of Deletion in AVL Tree
AVL Tree Quiz
Introduction
Insertion
Deletion
Introduction
Constructing and Evaluating an Expression Tree
Implementation of Expression Tree
Introduction
Inorder Traversal
Searching
Insertion
Implementation of Insertion - 1
Implementation of Insertion - 2
Deletion
Examples of Deletion from Leaf Node
Examples of Deletion from Non-Leaf Node
Implementation of Deletion
B-tree Quiz
Introduction
Terminology
Cycles
Connectivity in Undirected Graph
Connectivity in Directed Graphs
Tree and Forest
Graph Quiz A
Representation of Graph : Adjacency Matrix
Adjacency Matrix in Python
Adjacency List in Python
Transitive closure of a directed graph and Path Matrix
Warshall’s Algorithm
Warshall’s Algorithm in Python
Graph Quiz B
Introduction
Breadth First Search
Implementation of Breadth First Search
Finding Shortest path in an unweighted graph
BFS Spanning Tree
BFS in Undirected Graphs : Finding Connected Components
Depth First Search
Implementation of Depth First Search through Stack
Recursive Implementation of Depth First Search
Classification of Edges in DFS of Directed Graph
Classification of Edges in DFS of Undirected Graph
Shortest Path Problem
Dijkstra's Algorithm
Dijkstra's Algorithm : Example
Dijkstra's Algorithm in Python
Introduction
Prim’s Algorithm
Prim's Algorithm : Example
Prim’s Algorithm in Python
Kruskal’s Algorithm
Kruskal's Algorithm : Example
Implementation of Kruskal's Algorithm
Kruskal’s Algorithm in Python
Graph Quiz C
About Course
Data Structures and Algorithms In Python
Preview
Source Code Repository
Algorithm Analysis
Data Structures and Algorithms
Preview
Measuring Running time of Algorithms
Preview
Asymptotic Analysis
Preview
Big O Notation
Preview
Finding Big O
Preview
Tight and Loose Upper Bounds
Preview
Introduction Quiz A
Big O analysis of Algorithms
Finding Time complexity
Big O analysis of Algorithms: Examples
Worst case, Best case and Average Case Analysis
Common Complexities
Abstract Data Types
Introduction Quiz B
Linked List
Introduction to Linked List
Traversing and Searching a Linked List
Finding references in a Single Linked List
Difference between while p is not None: and while p.link is not None:
Insertion in a Single Linked List
Insertion in a Single Linked List...contd
Deletion in a Single Linked List
Reversing a Single Linked List
Linked List Quiz A
Sorting a Linked list using Bubble Sort
Merging of sorted Linked lists
Sorting a Linked list using Merge Sort
Finding and Removing a cycle in a Linked list
Doubly Linked List
Insertion in a doubly linked list
Deletion from doubly linked list
Reversing a doubly linked list
Circular linked list
Insertion in a circular Linked List
Deletion in a circular linked list
Concatenation
Linked List with Header Node
Sorted linked list
Linked List Quiz B
Stack and Queue
Introduction
Stack
Array Implementation of Stack
Linked List Implementation of Stack
Queue
Array Implementation of Queue
Linked List implementation of Queue
Queue through Circular Linked List
Circular Queue
Deque
Priority Queue
Checking validity of an expression containing nested parentheses
Evaluating Arithmetic Expressions
Polish Notations
Converting infix expression to postfix expression
Evaluation of postfix expression
Stack and Queue Quiz
Binary Tree
Introduction to trees
Binary Tree
Strictly Binary Tree and Extended Binary Tree
Full binary tree and Complete Binary Tree
Array Representation of Binary trees
Linked Representation of Binary Trees
Binary Tree Quiz A
Binary Tree in Python
Traversal in Binary Tree
Preorder Traversal
Inorder Traversal
Postorder Traversal
Level order traversal
Finding height of a Binary tree
Constructing Binary tree from Traversals
Constructing binary tree from inorder and preorder traversals
Constructing binary tree from inorder and postorder traversals
Binary Tree Quiz B
Binary Search Tree
Introduction
Traversal in Binary Search Tree
Searching in a Binary Search Tree
Nodes with Minimum and Maximum key
Insertion in a Binary Search Tree
Deletion in a Binary Search Tree
Binary Search Tree Quiz
Heap
Introduction
Heap Representation
Insertion in Heap
Deletion
Building a heap
Heap Applications
Heap Tree Quiz
Sorting
Introduction to Sorting Algorithms
Sort Stability
Selection Sort
Selection Sort : Example
Selection Sort in Python
Analysis of Selection Sort
Bubble Sort
Bubble Sort : Example
Bubble Sort in Python
Improvement in Bubble Sort
Analysis of Bubble Sort
Sorting Quiz A
Insertion Sort
Insertion Sort : Example
Insertion Sort in Python
Analysis of Insertion sort
Shell Sort
Shell Sort : Example
Shell Sort in Python
Analysis of Shell Sort
Merging two Sorted Arrays
Recursive Merge Sort
Recursive Merge Sort in Python
Analysis of Merge Sort
Iterative Merge Sort
Iterative Merge Sort in Python
Quick Sort
Quick Sort in Python
Analysis of Quick Sort
Binary tree sort
Binary Tree Sort in Python
Analysis of Binary Tree Sort
Heap Sort
Heap Sort : Python implementation and Analysis
Radix Sort
Radix Sort : Python implementation and Analysis
Sorting Quiz B
Searching
Linear Search
Linear Search in Sorted List
Binary Search
Implementation of Binary Search
Analysis of Binary Search
Hashing
Direct Addressing
Hashing
Collisions
Hash Functions
Open Addressing : Linear Probing
Open Addressing : Quadratic Probing
Open Addressing : Double Hashing
Deletion in Open Addressed Tables
Implementation of Open Addressing
Separate Chaining
Implementation of Separate Chaining
Hashing Quiz
AVL Tree
Introduction
Rotations
Insertion in AVL tree - 1
Insertion in AVL tree - 2
Insertion in AVL tree - 3
Insertion in AVL tree - 4
AVL Tree insertion cases
Examples of insertion in AVL Tree
Deletion in AVL Tree - 1
Deletion in AVL Tree - 2
Deletion in AVL Tree - 3
AVL Tree deletion cases
Examples of Deletion in AVL Tree
AVL Tree Quiz
Threaded Binary Tree
Introduction
Insertion
Deletion
Expression Tree
Introduction
Constructing and Evaluating an Expression Tree
Implementation of Expression Tree
B Tree
Introduction
Inorder Traversal
Searching
Insertion
Implementation of Insertion - 1
Implementation of Insertion - 2
Deletion
Examples of Deletion from Leaf Node
Examples of Deletion from Non-Leaf Node
Implementation of Deletion
B-tree Quiz
Graph
Introduction
Terminology
Cycles
Connectivity in Undirected Graph
Connectivity in Directed Graphs
Tree and Forest
Graph Quiz A
Representation of Graph : Adjacency Matrix
Adjacency Matrix in Python
Preview
Adjacency List in Python
Preview
Transitive closure of a directed graph and Path Matrix
Warshall’s Algorithm
Warshall’s Algorithm in Python
Preview
Graph Quiz B
Traversal In Graph
Introduction
Breadth First Search
Implementation of Breadth First Search
Finding Shortest path in an unweighted graph
BFS Spanning Tree
BFS in Undirected Graphs : Finding Connected Components
Depth First Search
Implementation of Depth First Search through Stack
Recursive Implementation of Depth First Search
Classification of Edges in DFS of Directed Graph
Classification of Edges in DFS of Undirected Graph
Shortest Paths In Graph
Shortest Path Problem
Dijkstra's Algorithm
Dijkstra's Algorithm : Example
Dijkstra's Algorithm in Python
Preview
Minimum Spanning Tree of a Graph
Introduction
Prim’s Algorithm
Prim's Algorithm : Example
Prim’s Algorithm in Python
Kruskal’s Algorithm
Kruskal's Algorithm : Example
Implementation of Kruskal's Algorithm
Kruskal’s Algorithm in Python
Graph Quiz C
×
This is an unpublished lesson. This lesson will not be shown for students unless you set it as Public.
Back to Dashboard
No contents are available in this lesson!
No lessons available !
Back to Dashboard
Lesson contents locked
Enroll to unlock this lesson.
Enroll to unlock
Next Lesson