Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps

About Course

• This is an animated, visual and spatial way to learn data structures and algorithms

  • Our brains process different types of information differently - evolutionarily 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

Topics covered in this course

• Section 1: Strong Fundamentals: Data Structures!
  	Lecture 1	You, This Course, and Us!	01:09
  	Lecture 2	Meet The Stack - Simple But Powerful	15:40
  	Lecture 3	Building A Stack Using Java	16:53
  	Lecture 4	Match Parenthesis To Check A Well Formed Expression	11:21
  	Lecture 5	Find The Minimum Element In A Stack In Constant Time	08:51
  	Lecture 6	Meet The Queue - A Familiar Sight In Everyday Life	14:11
  	Lecture 7	The Circular Queue - Tricky But Fast	19:44
  	Lecture 8	Build A Queue With Two Stacks	17:30
  Section 2: Binary Trees
  	Lecture 9	Meet The Binary Tree - A Hierarchical Data Structure	13:03
  	Lecture 10	Breadth First Traversal	18:43
  	Lecture 11	Depth First - Pre-OrderTraversal	14:35
  	Lecture 12	Depth First - In-Order and Post-Order Traversal	13:51
  Section 3: Binary Search Trees
  	Lecture 13	The Binary Search Tree - an introduction	09:49
  	Lecture 14	Insertion and Lookup in a Binary Search Tree	17:00
  Section 4: Binary Tree Problems
  	Lecture 15	Minimum Value, Maximum Depth and Mirror	11:46
  	Lecture 16	Count Trees, Print Range and Is BST	14:39
  	Lecture 17	Has Path Sum, Print Paths, Least Common Ancestor	14:49
  Section 5: Heaps
  	Lecture 18	The Heap Is Just The Best Way to Implement a Priority Queue	17:15
  	Lecture 19	Meet The Binary Heap - It's A Tree At Heart	12:39
  	Lecture 20	The Binary Heap - Making It Real With Code	07:38
  	Lecture 21	The Binary Heap - Logically A Tree Really An Array	17:13
  	Lecture 22	Heapify!	19:32
  	Lecture 23	Insert And Remove From A Heap	16:34

What you will get from this course?

• • Design and implement software that use fundamental data structures
  • Visualise - really vividly imagine - the common data structures, and the algorithms applied to them
  • Understand the trade-offs, complexity and use-cases for different types of container data structures

  What's Covered:

  • Big-O notation and complexity
  • Stacks
  • Queues
  • Trees
  • Heaps

Who should buy this course?

• • Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms'
  • Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
  • Experienced software engineers who are looking to refresh important fundamental concepts
  • Basic knowledge of programming is assumed, preferably in Java