Media is too big
VIEW IN TELEGRAM
1. Introduction
ThePrimeagen introduces the new algorithms course and mentions that they will be using various algorithms and the ones they find the most fun. They also mention that a basic understanding of algorithms, including walking a tree and recursion, is expected from the students.
#lesson
ThePrimeagen introduces the new algorithms course and mentions that they will be using various algorithms and the ones they find the most fun. They also mention that a basic understanding of algorithms, including walking a tree and recursion, is expected from the students.
#lesson
Media is too big
VIEW IN TELEGRAM
2. Binary Search Tree Overview
ThePrimeagen introduces the concept of binary trees and binary search trees. They explain the structure and properties of binary trees, including full binary trees and complete binary trees. They also demonstrate how to search for a value in a binary search tree and discuss the efficiency of binary search trees in terms of search time.
#lesson
ThePrimeagen introduces the concept of binary trees and binary search trees. They explain the structure and properties of binary trees, including full binary trees and complete binary trees. They also demonstrate how to search for a value in a binary search tree and discuss the efficiency of binary search trees in terms of search time.
#lesson
🔥1
Media is too big
VIEW IN TELEGRAM
3. Traversals
ThePrimeagen discusses the concept of traversals in binary trees and explains the three types of traversals: pre-order, in-order, and post-order. The instructor demonstrates how each traversal works by visually walking through a binary tree and explaining the steps taken to visit each node. They also provide insights on representing nodes in code and offer tips for translating the concepts into code.
#lesson
ThePrimeagen discusses the concept of traversals in binary trees and explains the three types of traversals: pre-order, in-order, and post-order. The instructor demonstrates how each traversal works by visually walking through a binary tree and explaining the steps taken to visit each node. They also provide insights on representing nodes in code and offer tips for translating the concepts into code.
#lesson
Media is too big
VIEW IN TELEGRAM
4. Deletions & Insertions
#lesson
#lesson
Media is too big
VIEW IN TELEGRAM
12. B-Tree Internal Deletion
#lesson
#lesson
Media is too big
VIEW IN TELEGRAM
14. Adjacency Lists & Matrices
#lesson
#lesson
Media is too big
VIEW IN TELEGRAM
17. Spanning Trees & Prim's Algorithm
#lesson
#lesson
Media is too big
VIEW IN TELEGRAM
20. Ford-Fulkerson- Max Flow
#lesson
#lesson