Find the minimum value in a binary search tree, find the maximum depth of a binary tree and mirror a binary tree. Learn to solve these problems recursively and see implementation details.
r/>
This clip is from the chapter...

Learn about abstract data types and how they relate to data structures.
r/>
This clip is from the chapter "Data Structures And Algorithms - A Symbiotic Relationship" of the series "From 0 to 1: Data Structures & Algorithms in...

Let's practice heap problems! Use the heap property to find the largest element in a minimum heap and the K largest elements in a stream.
r/>
This clip is from the chapter "Heap Problems" of the series "From 0 to 1: Data...

Learn what a BST is and how we can use it.
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 binary tree with specific...

Learn to measure performance and complexity of your code and relation between the two.
r/>
This clip is from the chapter "Complexity Analysis and the Big-O Notation" of the series "From 0 to 1: Data Structures & Algorithms in...

Here, we build a stack for real using Java. It'll have all the operations we're interested in - push, pop, peek, size etc.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures &...

Practice finding the complexity of some sample pieces of code.
r/>
This clip is from the chapter "Complexity Analysis and the Big-O Notation" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we...

A minimal spanning tree is a tree which covers all the vertices of graph and has the lowest cost.
r/>
This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...

Let's see what a binary tree looks like and learn some simple terminology associated with the tree.
r/>
This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this...

Learn to write the most efficient code to mimic the behaviour of a queue using 2 stacks.
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,...

Dealing with negative weights have some quirks which are dealt with using the Bellman Ford algorithm.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...

Find the shortest path in a weighted graph is a greedy algorithm.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced...

Compare the adjacency matrix, adjacency list and the adjacency set in terms of space and time complexity of common operations.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms...

Count the number of structurally unique binary trees that can be built with N nodes, print the nodes within a certain range in a binary search tree and check whether a certain binary tree is a binary *search* tree.
r/>
This...

Depth first traversal can be of 3 types based on the order in which the node is processed relative to its left and right sub-trees. Pre-order traversal processes the node before processing the left and then the right sub trees.
r/> ...

The graph interface allows building up a graph by adding edges and traversing a graph by giving access to all adjacent vertices of any vertex.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data...

Binary search is a pretty nifty way to search through a sorted list in O(Log N) time.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about...

Learn to keep track of the minimum element of a stack as it changes.
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, we build stack...

Kruskal's algorithm is another greedy algorithm to find a minimal spanning tree.
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...

Graphs with simple edges (directed or undirected) are unweighted graphs. The distance table is an important data structure used to find the shortest path between any two vertices on a graph.
r/>
This clip is from the chapter...

Study of graphs and algorithms associated with graphs forms an entire field of study called graph theory.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author...

A graph with directed edges forms a Directed Graph and those with undirected edges forms an Undirected Graph.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The...

Visualize how the Bellman Ford works to find the shortest path in a graph with negative weighted edges.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...

Visualize the shortest path algorithm using the distance table, step by step.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we...