Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Advanced Data Structures and Algorithms in Java
About Course
Advanced Data Structures and Algorithms in Java (1:23)
Source Code Repository
AVL Tree
Introduction (7:13)
Rotations (7:12)
Insertion in AVL tree - 1 (10:43)
Insertion in AVL tree - 2 (9:21)
Insertion in AVL tree - 3 (14:13)
Insertion in AVL tree - 4 (4:39)
Examples of insertion in AVL Tree (7:15)
Deletion in AVL Tree - 1 (5:12)
Deletion in AVL Tree - 2 (10:36)
Deletion in AVL Tree - 3 (5:39)
Examples of Deletion in AVL Tree (7:58)
Threaded Binary Tree
Introduction (12:27)
Insertion (5:12)
Deletion (7:36)
B tree
Introduction (11:39)
Inorder Traversal (5:26)
Searching (9:36)
Insertion (14:21)
Implementation of Insertion - 1 (19:02)
Implementation of Insertion - 2 (7:12)
Deletion (3:47)
Examples of Deletion from Leaf Node (9:31)
Examples of Deletion from Non-Leaf Node (3:31)
Implementation of Deletion (12:22)
Graph
Introduction (3:25)
Terminology (9:09)
Cycles (3:13)
Connectivity in Undirected Graph (5:50)
Connectivity in Directed Graphs (3:23)
Tree and Forest (3:17)
Representation of Graph : Adjacency Matrix (5:40)
Adjacency Matrix in Java (14:47)
Representation of Graph : Adjacency List (5:51)
Adjacency List in Java (9:59)
Transitive closure of a directed graph and Path Matrix (9:45)
Warshall’s Algorithm (10:18)
Warshall’s Algorithm in Java (2:01)
Traversal In Graph
Introduction (2:42)
Breadth First Search (5:05)
Implementation of Breadth First Search (6:54)
Finding Shortest path in an unweighted graph (7:59)
BFS Spanning Tree (2:45)
BFS in Undirected Graphs : Finding Connected Components (7:19)
Depth First Search (3:41)
Implementation of Depth First Search through Stack (7:34)
Recursive Implementation of Depth First Search (6:06)
Classification of Edges in DFS of Directed Graph (6:59)
Classification of Edges in DFS of Undirected Graph (4:53)
Shortest Paths in Graph
Shortest Path Problem (2:25)
Dijkstra’s Algorithm (9:04)
Dijkstra’s Algorithm : Example (8:29)
Dijkstra's Algorithm in Java (4:47)
Minimum Spanning Tree of a Graph
Introduction (1:31)
Prim’s Algorithm (3:38)
Prim's Algorithm : Example (6:10)
Prim’s Algorithm in Java (4:12)
Kruskal’s Algorithm (2:33)
Kruskal's Algorithm : Example (3:48)
Implementation of Kruskal's Implementation (10:29)
Kruskal’s Algorithm in Java (4:59)
Teach online with
Recursive Implementation of Depth First Search
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock