8.2 Compressed Tries | Advantage with Proof | Examples | Tries | Range Queries

Tries Introduction (Previous Video) :    • 8.1 Trie Data Structure | Complete Introdu...  
Suffix Trees (Next Video) :    • 8.3 Suffix Trees | Advantage with Proof | ...  

In this video, we will learn the following about Compressed Tries:

i) What is a Compressed Trie?
ii) How to convert a standard trie to a compressed trie?
iii) What are Range Queries?
iv) Proof of Space Complexity Advantage in compressed tries

Advanced Data Structures Playlist Link :    • Advanced Data Structures  

Channel Link ( Share & Subscribe ) :    / @uzairjavedakhtar3718  

Timestamps:
0:00 Introduction
1:42 What is a compressed trie?
2:45 Converting Standard trie to Compressed trie
9:05 Range Queries
12:55 How Compressed Tries reduce space complexity?









Tags and Hashtags:

#Tries #compressedTries #TrieDataStructure #datastructures #BloomFilters #introduction #hashing #dsa #heap #advantages #advanceddatastructures #advanceddsa #trees #timecomplexity #leftisttree #leftistheap #binaryheap #deleteoperation #probabilisticnature #probability #falsepositives #binomialcoefficient #binomial #examples #examples #trees #array #linkedlist #stack #queue #interviewPreparation #ugc #university #cse #IT #amazon #google #microsoft #adobe #meta #facebook #apple #linkedin #algorithms #quora #insertoperation #searchoperation #patternMatching #stringMatching


what is a Trie?
Why Trie?
what is tries?
what are trie?
insertion in trie
search operation in trie
probabilistic nature of bloom filter
why bloom filter?
advantages of bloom filter
data structures
complete intro of tries
basics of tries
advanced data structures
dsa
advantages
advanced dsa
time complexity
binomial trees
properties of fibonacci heaps
binomial heap
introduction
proof
example
what is a fibonacci heap
trees
binary heap
binomial tree
what is a binomial heap
fibonacci heap
what is a fibonacci heap
fibbonaci heap
what are fibonacci heaps?
why fibonacci heap?
what is heap
heap