Video Description
Learn so you can see it with your eyes closed
About This Video
 Data Structures and Algorithms are best learnt visually  highquality courses available at super low prices
In Detail
This is an animated, visual and spatial way to learn data structures and algorithms. Our brains process different types of information differently  evolutionary we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see it. More than most other concepts, Data Structures and Algorithms are best learnt visually. These are incredibly easy to learn visually, very hard to understand most other ways. This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart What's Covered: BigO notation and complexity, Stacks, Queues, Trees, Heaps, Graphs and Graph Algorithms, Linked lists, Sorting, Searching.
Table of Contents

Chapter 1 : What this course is about
 You, This course and Us 00:03:03
 Chapter 2 : Data Structures And Algorithms  A Symbiotic Relationship

Chapter 3 : Complexity Analysis and the BigO Notation
 Performance and Complexity 00:16:02
 The BigO Notation 00:15:58
 What is the complexity of these pieces of code? 00:19:14

Chapter 4 : Linked Lists
 The Linked List  The Most Basic Of All Data Structures 00:19:55
 Linked List Problems 00:10:25
 Linked Lists vs Arrays 00:10:27

Chapter 5 : Stacks And Queues
 Meet The Stack  Simple But Powerful 00:15:41
 Building A Stack Using Java 00:16:53
 Match Parenthesis To Check A Well Formed Expression 00:11:22
 Find The Minimum Element In A Stack In Constant Time 00:08:51
 Meet The Queue  A Familiar Sight In Everyday Life 00:14:11
 The Circular Queue  Tricky But Fast 00:19:45
 Build A Queue With Two Stacks 00:17:30

Chapter 6 : Sorting and Searching
 Sorting TradeOffs 00:10:53
 Selection Sort 00:15:25
 Bubble Sort 00:14:40
 Insertion Sort 00:14:32
 Shell Sort 00:14:13
 Merge Sort 00:19:23
 Quick Sort 00:15:30
 Binary Search  search quickly through a sorted list 00:11:11

Chapter 7 : Binary Trees
 Meet The Binary Tree  A Hierarchical Data Structure 00:13:03
 Breadth First Traversal 00:18:43
 Depth First  PreOrderTraversal 00:14:35
 Depth First  InOrder and PostOrder Traversal 00:13:52
 Chapter 8 : Binary Search Trees

Chapter 9 : Binary Tree Problems
 Minimum Value, Maximum Depth And Mirror 00:12:14
 Count Trees, Print Range and Is BST 00:14:39

Chapter 10 : Heaps
 The Heap Is Just The Best Way to Implement a Priority Queue 00:17:16
 Meet The Binary Heap  It's A Tree At Heart 00:12:40
 The Binary Heap  Logically A Tree Really An Array 00:17:14
 The Binary Heap  Making It Real With Code 00:07:38
 Heapify! 00:19:33
 Insert And Remove From A Heap 00:16:35

Chapter 11 : Revisiting Sorting  The Heap Sort
 Heap Sort Phase I – Heapify 00:19:31
 Heap Sort Phase II  The Actual Sort 00:17:43
 Chapter 12 : Heap Problems

Chapter 13 : Graphs
 Introducing The Graph 00:15:40
 Types Of Graphs 00:07:21
 The Directed And Undirected Graph 00:14:29
 Representing A Graph In Code 00:08:09
 Graph Using An Adjacency Matrix 00:15:25
 Graph Using An Adjacency List And Adjacency Set 00:17:54
 Comparison Of Graph Representations 00:10:09
 Graph Traversal  Depth First And Breadth First 00:14:56

Chapter 14 : Graph Algorithms
 Topological Sort In A Graph 00:17:31
 Implementation Of Topological Sort 00:06:57

Chapter 15 : Shortest Path Algorithms
 Introduction To Shortest Path In An Unweighted Graph  The Distance Table 00:12:39
 The Shortest Path Algorithm Visualized 00:14:15
 Implementation Of The Shortest Path In An Unweighted Graph 00:06:19
 Introduction To The Weighted Graph 00:03:29
 Shortest Path In A Weighted Graph  A Greedy Algorithm 00:18:47
 Dijkstra's Algorithm Visualized 00:14:15
 Implementation Of Dijkstra's Algorithm 00:08:15
 Introduction To The Bellman Ford Algorithm 00:08:40
 The Bellman Ford Algorithm Visualized 00:11:22
 Dealing With Negative Cycles In The Bellman Ford Algorithm 00:07:36
 Implementation Of The Bellman Ford Algorithm 00:06:54
 Chapter 16 : Spanning Tree Algorithms
 Chapter 17 : Graph Problems
Product Information
 Title: From 0 to 1: Data Structures & Algorithms in Java
 Author(s):
 Release date: September 2017
 Publisher(s): Packt Publishing
 ISBN: 9781788626767