Heaps / Array Representation of Trees
Channel:
Subscribers:
2,650
Published on ● Video Link: https://www.youtube.com/watch?v=Bg2QWHvk6xw
5We covered heaps today, which are tops at returning the max or min item, and have some great properties like easily always being balanced, compact, and possible to be held in a vector instead of needing pointers.
We also gave a little preview of higher level data structures.
Other Videos By Bill Kerney
| 2024-04-26 | RPG42: Project Guidelines |
| 2024-04-25 | C++ Multithreading: OpenMP, Atomics, Threads |
| 2024-04-22 | C++ Error Handling: Exceptions |
| 2024-04-22 | Unix and Vim Quiz #3 |
| 2024-04-19 | Vim Macros |
| 2024-04-19 | C++ Bitwise Part 2 |
| 2024-04-17 | C++ Bitwise |
| 2024-04-15 | Huffman Coding (Conceptual) |
| 2024-04-12 | Tries, and inspiring words |
| 2024-04-10 | C++: Hash Tables |
| 2024-04-08 | Heaps / Array Representation of Trees |
| 2024-04-03 | Intro to Rust for C++ People |
| 2024-04-01 | Memory Allocation Review and Pointer Tricks |
| 2024-04-01 | Big O Review |
| 2024-04-01 | C++: The Nameless (Classes, Lamdas, Variables) |
| 2024-03-18 | College Path Lecture (Class Offerings and Transfer Possibilities) |
| 2024-03-18 | Recursion |
| 2024-03-15 | RPG-41 Overview |
| 2024-03-15 | UNIX / Vim Quiz #2 |
| 2024-03-11 | Black Box BST Debugging / BST Delete Algorithm |
| 2024-03-08 | Quiz Time: UNIX and Vim |