Published Jan 21, 2019

Data Structures - Heaps and Tries

Uncover the transformative role of trie and heap data structures, as Joe Zack, Michael Outlaw, and Allen Underwood delve into their practical applications and efficiencies, such as optimizing spellcheck and priority queue operations, while also exploring broader trends in digital communication and media consumption.

Episode Highlights

Topics covered

Episode Highlights

Related Episodes

Data Structures - (some) Trees
Answers 383 questions
Data Structures - Arrays and Array-ish
Answers 383 questions
95. Data Structures – Arrays and Array-ish
Answers 383 questions
94. Data Structures - Primitives
Answers 383 questions
Designing Data-Intensive Applications - SSTables and LSM-Trees
Answers 383 questions
Designing Data-Intensive Applications – Storage and Retrieval
Answers 383 questions
Algorithms You Should Know
Answers 383 questions
Hierarchical Data – Adjacency Lists and Nested Set Models
Answers 383 questions
Designing Data-Intensive Applications - Reliability
Answers 383 questions
Designing Data-Intensive Applications – Multi-Leader Replication
Answers 383 questions
Graph Algorithms
Answers 383 questions
Designing Data-Intensive Applications – Lost Updates and Write Skew
Answers 383 questions
Technical Challenges of Scale at Twitter
Answers 383 questions
Designing Data-Intensive Applications – Data Models: Query Languages
Answers 383 questions
Designing Data-Intensive Applications – Data Models: Relationships
Answers 383 questions

Dexa/Coding Blocks

Data Structures - Heaps and Tries

Topics covered

Popular Clips

Efficient Trie Data Structures

English Language Complexity

Tech Trends Discussion

Logarithmic Insights

Space Complexity Insights

Fast Excitement

Efficient Heap Data Structure

Binary Tree Operations

Conference Insights

Heap Storage

Visual Studio Colorizer Plugin

Trie Data Structure

Priority Queue Visualization

Zootopia and Podcast News

Episode Highlights

Tech Trends

Trie Data Structures

Heap Data Structures

Related Episodes

Data Structures - (some) Trees

Data Structures - Arrays and Array-ish

95. Data Structures – Arrays and Array-ish

94. Data Structures - Primitives

Designing Data-Intensive Applications - SSTables and LSM-Trees

Designing Data-Intensive Applications – Storage and Retrieval

Algorithms You Should Know

Hierarchical Data – Adjacency Lists and Nested Set Models

Designing Data-Intensive Applications - Reliability

Designing Data-Intensive Applications – Multi-Leader Replication

Graph Algorithms

Designing Data-Intensive Applications – Lost Updates and Write Skew

Technical Challenges of Scale at Twitter

Designing Data-Intensive Applications – Data Models: Query Languages

Designing Data-Intensive Applications – Data Models: Relationships

Data Structures - Heaps and Tries

Topics covered

Popular Clips

Episode Highlights

Tech TrendsThe discussion shifts to the evolution of communication technology and its impact on data usage. Allen Underwood and Joe Zack explore how messaging apps and digital consumption trends are reshaping our interactions and media consumption habits.

Tech Trends

Trie Data StructuresThe episode explores the practical applications and efficiencies of trie data structures, particularly in spellchecking and autocomplete functions. Michael Outlaw and Allen Underwood discuss how tries optimize space and time compared to other data structures.

Trie Data Structures

Heap Data StructuresIn this episode, Michael Outlaw and Joe Zack explore the unique properties and practical implementations of heaps. They discuss how heaps, with their array-based structure, offer efficient solutions for priority queues and other specialized tasks.

Heap Data Structures

Related Episodes