Published Jan 8, 2019
Data Structures - (some) Trees
Joe Zack and Michael Outlaw delve into the world of tree data structures, examining their critical roles in software abstraction, database performance, recursive programming, and efficient data management. They highlight the balance between leveraging technology-specific advantages and maintaining optimal efficiency with structures like binary and B-trees in various applications.
Topics covered
Popular Clips
Episode Highlights
Related Episodes
Data Structures - Heaps and Tries
Answers 383 questions
Data Structures - Arrays and Array-ish
Answers 383 questions95. Data Structures – Arrays and Array-ish
Answers 383 questionsDesigning Data-Intensive Applications - SSTables and LSM-Trees
Answers 383 questions94. Data Structures - Primitives
Answers 383 questionsDesigning Data-Intensive Applications - To B-Tree or not to B-Tree
Answers 383 questionsDesigning Data-Intensive Applications – Storage and Retrieval
Answers 383 questionsAlgorithms You Should Know
Answers 383 questionsHierarchical Data – Adjacency Lists and Nested Set Models
Answers 383 questionsGraph Algorithms
Answers 383 questionsDesigning Data-Intensive Applications – Data Models: Relationships
Answers 383 questionsClean Code - How to Write Classes the Right Way
Answers 383 questionsClean Architecture - Are Microservices Truly Decoupled?
Answers 383 questionsDesigning Data-Intensive Applications – Multi-Leader Replication
Answers 383 questionsDesigning Data-Intensive Applications – Partitioning
Answers 383 questions