Learn the implementation details of tree and graph data structures, interview questions involving them, and the algorithms to solve them. This course builds on Bianca’s Practical Algorithms and Data Structures for Interviews courses. Unlike arrays, trees and graphs are non-linear. This allows for modeling things such as recommendation algorithms and social networks.
Overview
Syllabus
- Course Overview
- Arrays & Linked Lists Review
- Stacks & Queues Review
- Linear vs Non-Linear Data Structures
- Modeling a Chatbot
- Introduction to Trees
- Linear vs Non-Linear Data Modeling
- Exploring Data Modeling
- Family Trees
- Tree insert & remove Exercise
- Tree insert Solution
- Tree remove Solution
- Chatbot Recommendations
- Coding a Tree
- Tree Traversal
- Traversing One Tree
- Traversing Nested Trees
- Binary Tree Traversal Exercise
- Binary Tree traverse Solution
- Binary Tree contains Solution
- Binary Tree contains Walkthrough
- Count Recommendations
- Tree Methods Time Complexity
- Tree Traversal Order
- Drawing a Graph
- Adjacency Matrix
- Adjacency List
- Matrix vs List Comparison
- Graph Exercise
- Graph Solution
- Search & Personal Recommendations
- Depth First Search
- Depth First Search Exercise
- Depth First Search Solution
- Breadth First Search
- Breadth First Search Exercise
- Breadth First Search Solution
- Depth-First & Breadth-First Search Usage
- Directed Graphs
- Binary Search
- Binary Search Trees
- Fill the Tree Activity
- insert Node
- Binary Search Exercise
- Binary Search Solution
- Binary Search Time Complexity
- Wrapping Up
Taught by
Bianca Gandolfo
