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

Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps, available at $54.99, has an average rating of 4.9, with 23 lectures, based on 24 reviews, and has 2604 subscribers.

You will learn about 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 This course is ideal for individuals who are Nope! 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' or Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work or Yep! Experienced software engineers who are looking to refresh important fundamental concepts It is particularly useful for Nope! 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' or Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work or Yep! Experienced software engineers who are looking to refresh important fundamental concepts.

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

Summary

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

Price: $54.99

Average Rating: 4.9

Number of Lectures: 23

Number of Published Lectures: 23

Number of Curriculum Items: 23

Number of Published Curriculum Objects: 23

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

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

Who Should Attend

Nope! 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'
Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
Yep! Experienced software engineers who are looking to refresh important fundamental concepts

Target Audiences

Nope! 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'
Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
Yep! Experienced software engineers who are looking to refresh important fundamental concepts

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

Course Curriculum

Chapter 1: Strong Fundamentals: Data Structures!

Lecture 1: You, This Course, and Us!

Lecture 2: Meet The Stack – Simple But Powerful

Lecture 3: Building A Stack Using Java

Lecture 4: Match Parenthesis To Check A Well Formed Expression

Lecture 5: Find The Minimum Element In A Stack In Constant Time

Lecture 6: Meet The Queue – A Familiar Sight In Everyday Life

Lecture 7: The Circular Queue – Tricky But Fast

Lecture 8: Build A Queue With Two Stacks

Chapter 2: Binary Trees

Lecture 1: Meet The Binary Tree – A Hierarchical Data Structure

Lecture 2: Breadth First Traversal

Lecture 3: Depth First – Pre-OrderTraversal

Lecture 4: Depth First – In-Order and Post-Order Traversal

Chapter 3: Binary Search Trees

Lecture 1: The Binary Search Tree – an introduction

Lecture 2: Insertion and Lookup in a Binary Search Tree

Chapter 4: Binary Tree Problems

Lecture 1: Minimum Value, Maximum Depth and Mirror

Lecture 2: Count Trees, Print Range and Is BST

Lecture 3: Has Path Sum, Print Paths, Least Common Ancestor

Chapter 5: Heaps

Lecture 1: The Heap Is Just The Best Way to Implement a Priority Queue

Lecture 2: Meet The Binary Heap – It's A Tree At Heart

Lecture 3: The Binary Heap – Making It Real With Code

Lecture 4: The Binary Heap – Logically A Tree Really An Array

Lecture 5: Heapify!

Lecture 6: Insert And Remove From A Heap

Instructors

Loony Corn
An ex-Google, Stanford and Flipkart team

Rating Distribution

1 stars: 0 votes
2 stars: 1 votes
3 stars: 0 votes
4 stars: 3 votes
5 stars: 20 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu