This video will make things easy to follow. Topological sort is widely used in real world problems.
r/>
This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...

Depth first traversal can be of 3 types based on the order in which the node is processed relative to it's left and right sub-trees.
r/>
This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures &...

Learn more about queues which are much more intuitive as there are plenty of real world examples where a queue is the fair and correct way of processing.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From...

Common traversal methods of trees apply to graphs as well. There is an additional wrinkle with graphs, dealing with cycles and with unconnected graphs.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data...

Let's visualize breadth first traversal and see how it's implemented.
r/>
This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we study more about...

Let's see what makes quick sort so attractive.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and searching functions from...

Learn how you can make an informed choice between Linked lists and arrays which solve the same kind of problems, holding a list or a collection.
r/>
This clip is from the chapter "Linked Lists" of the series "From 0 to 1: Data...

Learn to implement Krushal’s Algorithm.
r/>
This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Prim's algorithm is very similar to Dijkstra's shortest path...

Let's build a real heap in Java!
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data structure, build a real heap in Java and...

Learn more about simplest and most naive sorting algorithm.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and searching...

Learn various uses of stack which is a very simple and easy to understand data structure.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section,...

Learn how to model using either Directed or Undirected graphs.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces you to various types of graphs...

Learn the most efficient way to implement the Binary Heap using an array.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data...

Learn to ensure that when we add an element or remove an element from an existing heap, so that the heap property and shape property is maintained.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data...

Let's see how exactly it works and why it's preferred in many cases.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and...

The Heap Sort uses a heap to transform an unsorted array into a sorted array.
r/>
This clip is from the chapter "Revisiting Sorting - The Heap Sort" of the series "From 0 to 1: Data Structures & Algorithms in Java".The Heap...

Merge Sort belongs to a class of algorithms which uses divide and conquer to break the problem set into smaller pieces.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures &...

Here, we see how they work and understand their performance and complexity.
r/>
This clip is from the chapter "Binary Search Trees" of the series "From 0 to 1: Data Structures & Algorithms in Java".A Binary Search Tree is a...

Learn how is Big O expressed, how is it calculated and many examples to drive the concepts home.
r/>
This clip is from the chapter "Complexity Analysis and the Big-O Notation" of the series "From 0 to 1: Data Structures &...