BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

619What is a Trie? Motivation and Use Cases
620Trie Node Structure and Components
621Trie Insertion: Adding Words
622Trie Search: Exact Match Queries
623Prefix Search and StartsWith Operations
624Trie Deletion: Removing Words
625Memory Analysis of Tries
626Time Complexity of Trie Operations
627Trie Traversal Patterns
628Autocomplete with Tries
629Wildcard Matching in Tries
630Tries vs Hash Tables for String Storage
631Compressed Tries (Radix Trees)
632Radix Tree Implementation
633Patricia Tries (PATRICIA)
634Suffix Trees: Motivation and Structure
635Suffix Tree Construction Overview
636Suffix Tree Applications
637Ternary Search Trees
638Ternary Search Tree Operations
639Burst Tries
640Trie Variant Performance Comparison
641Segment Tree Motivation and Use Cases
642Segment Tree Structure and Representation
643Building a Segment Tree
644Range Query Operations
645Point Update Operations
646Range Update with Lazy Propagation
647Segment Tree Variants and Functions
648Segment Tree Time and Space Complexity
649Fenwick Tree (Binary Indexed Tree) Introduction
650Binary Representation and Index Manipulation
651Fenwick Tree Construction
652Point Update Operation
653Prefix Sum Query Operation
654Range Query and Range Update
655Fenwick Tree vs Segment Tree Trade-offs
656Fenwick Tree Applications

Computer Science

619What is a Trie? Motivation and Use Cases
620Trie Node Structure and Components
621Trie Insertion: Adding Words
622Trie Search: Exact Match Queries
623Prefix Search and StartsWith Operations
624Trie Deletion: Removing Words
625Memory Analysis of Tries
626Time Complexity of Trie Operations
627Trie Traversal Patterns
628Autocomplete with Tries
629Wildcard Matching in Tries
630Tries vs Hash Tables for String Storage
631Compressed Tries (Radix Trees)
632Radix Tree Implementation
633Patricia Tries (PATRICIA)
634Suffix Trees: Motivation and Structure
635Suffix Tree Construction Overview
636Suffix Tree Applications
637Ternary Search Trees
638Ternary Search Tree Operations
639Burst Tries
640Trie Variant Performance Comparison
641Segment Tree Motivation and Use Cases
642Segment Tree Structure and Representation
643Building a Segment Tree
644Range Query Operations
645Point Update Operations
646Range Update with Lazy Propagation
647Segment Tree Variants and Functions
648Segment Tree Time and Space Complexity
649Fenwick Tree (Binary Indexed Tree) Introduction
650Binary Representation and Index Manipulation
651Fenwick Tree Construction
652Point Update Operation
653Prefix Sum Query Operation
654Range Query and Range Update
655Fenwick Tree vs Segment Tree Trade-offs
656Fenwick Tree Applications

← Computer Science

Lesson 631 of 2,872·15. Tries and Specialized TreesPro lesson

Compressed Tries (Radix Trees)

Learn how compressed tries merge single-child chains into edges to reduce space and improve traversal efficiency.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course