Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps | Janani Ravi Vitthal Srinivasan | Skillshare

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

#### Janani Ravi Vitthal Srinivasan, An ex-Google, Stanford and Flipkart team

Play Speed
• 0.5x
• 1x (Normal)
• 1.25x
• 1.5x
• 2x
23 Videos (5h 25m)
• You, This Course, and Us!

1:09
• Meet The Stack - Simple But Powerful

15:40
• Building A Stack Using Java

16:53
• Match Parenthesis To Check A Well Formed Expression

11:21
• Find The Minimum Element In A Stack In Constant Time

8:51
• Meet The Queue - A Familiar Sight In Everyday Life

14:11
• The Circular Queue - Tricky But Fast

19:44
• Build A Queue With Two Stacks

17:30
• Meet The Binary Tree - A Hierarchical Data Structure.mp4

13:03

18:43
• Depth First - Pre-OrderTraversal

14:35
• Depth First - In-Order and Post-Order Traversal

13:51
• The Binary Search Tree - an introduction

9:49
• Insertion and Lookup in a Binary Search Tree

17:00
• Minimum Value, Maximum Depth And Mirror

12:14
• Count Trees, Print Range and Is BST

14:38
• Has Path Sum, Print Paths, Least Common Ancestor

14:49
• The Heap Is Just The Best Way to Implement a Priority Queue

17:15
• Meet The Binary Heap - It's A Tree At Heart

12:39
• The Binary Heap - Making It Real With Code

7:38
• The Binary Heap - Logically A Tree Really An Array

17:13
• Heapify!

19:32
• Insert And Remove From A Heap

16:34

Note: This course is a subset of our much longer course 'From 0 to 1: Data Structures & Algorithms' so please don't sign up for both:-)

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

What's Covered:

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

18

Students

--

Projects

• --
• Beginner
• Intermediate
• All Levels
• Beg/Int

Level

Community Generated

The level is determined by a majority opinion of students who have reviewed this class. The teacher's recommendation is shown until at least 5 student responses are collected.

#### Janani Ravi Vitthal Srinivasan

An ex-Google, Stanford and Flipkart team

Loonycorn is us, Janani Ravi and Vitthal Srinivasan. Between us, we have studied at Stanford, been admitted to IIM Ahmedabad and have spent years working in tech, in the Bay Area, New York, Singapore, and Bangalore.

Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft

Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too

We think we might have hit upon a neat way of teaching ...

See full profile

Technology Java Data Science Algorithms
Report class