Tries: Data Structures for String Processing
Jan 25 2025
Length: 16 mins
Podcast

Failed to add items

Sorry, we are unable to add the item because your shopping cart is already at capacity.

Add to Cart failed.

Please try again later

Add to Wish List failed.

Please try again later

Remove from wish list failed.

Please try again later

Follow podcast failed

Unfollow podcast failed

Tries: Data Structures for String Processing

Listen for free

View show details

Summary
A Trie, also known as a prefix tree, is a specialized tree-based data structure primarily used for efficiently storing and retrieving strings. Unlike traditional search trees where a node stores the entire key, each node in a trie represents a prefix shared by all its descendants. This unique structure facilitates fast search, insertion, and deletion operations based on string prefixes.

Show more Show less

Show more Show less

What listeners say about Tries: Data Structures for String Processing

Average Customer Ratings

Reviews - Please select the tabs below to change the source of reviews.

Audible.ca reviews

Amazon Reviews

No reviews are available

Report a review on Amazon