Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps
A visual way to master basic data structures for strong fundamentals!
4.90 (24 reviews)
2,602
students
5.5 hours
content
Jan 2018
last update
$54.99
regular price
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
Description
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
Content
Strong Fundamentals: Data Structures!
You, This Course, and Us!
Meet The Stack - Simple But Powerful
Building A Stack Using Java
Match Parenthesis To Check A Well Formed Expression
Find The Minimum Element In A Stack In Constant Time
Meet The Queue - A Familiar Sight In Everyday Life
The Circular Queue - Tricky But Fast
Build A Queue With Two Stacks
Binary Trees
Meet The Binary Tree - A Hierarchical Data Structure
Breadth First Traversal
Depth First - Pre-OrderTraversal
Depth First - In-Order and Post-Order Traversal
Binary Search Trees
The Binary Search Tree - an introduction
Insertion and Lookup in a Binary Search Tree
Binary Tree Problems
Minimum Value, Maximum Depth and Mirror
Count Trees, Print Range and Is BST
Has Path Sum, Print Paths, Least Common Ancestor
Heaps
The Heap Is Just The Best Way to Implement a Priority Queue
Meet The Binary Heap - It's A Tree At Heart
The Binary Heap - Making It Real With Code
The Binary Heap - Logically A Tree Really An Array
Heapify!
Insert And Remove From A Heap
Screenshots
Reviews
Ana
September 21, 2018
Everything is perfectly explained and exemplified. The accent might sound a little strange but after a few videos shouldn´t be a problem.
Saccheen
May 14, 2018
So far so good. I just need to implement the code in order to cement my understanding. Will be looking at other courses as well.
Deepak
September 5, 2016
The content is good, but the slides and the animation on the slides are extremely distracting. Could be a little more interpersonal more like a conversation and less like a classroom lecture. Good start ... looking for more interesting courses from you.
Charts
Price
Rating
Enrollment distribution
Related Topics
783718
udemy ID
3/6/2016
course created date
11/22/2019
course indexed date
Bot
course submited by