8.3 Suffix Trees | Advantage with Proof | Examples | Tries | Range Queries

Compressed Tries (Previous Video) : • 8.2 Compressed Tries |...
In this video, we will learn the following everything about Suffix Trees
Advanced Data Structures Playlist Link : • Advanced Data Structures
Channel Link ( Share & Subscribe ) : / @uzairjavedakhtar3718
Tags and Hashtags:
#Tries #SuffixTrees #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 Suffix Tree?
What are Suffix Trees?
example of suffix tree
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

[@Surya-Smarter]

You are doing a great job sir... The way you explained is awesome and it's very helpful to students who are pursuing graduation

[@uzairjavedakhtar3718]

Thanks A lot Surya for your kind words 😊
Please share the channel with your friends

[@siddheshshrirame6909]

Easy to understand teaching of complex algorithms . Simply amazing🤯

[@uzairjavedakhtar3718]

Happy to know that you understood it so well🤩

[@zedoman5518]

U r really great sir life saver u r🙏🙏🙏

[@uzairjavedakhtar3718]

Thanks A Lot for your kind words🖤

[@sekharsamanta6266]

crystal clear explanation. Thank you Sir!

[@mrunalwaghmare]

Thanks!!!

[@Forward-zi8lm]

thanks man 🤜🤛

[@krishnamoorthysridhar8536]

Good Explanation!! Thanks..

[@uzairjavedakhtar3718]

Glad you liked it☺️

[@rohanjain6783]

Great work sir

[@uzairjavedakhtar3718]

Thanks Rohan☺️
Please share the channel with your friends🙂

[@CptCommanderCool]

Great video series!

[@uzairjavedakhtar3718]

Thanks A Lot ☺️

[@sanjayharitwal1608]

it was helpfull

[@rohandeshmukh3989]

great explanation sir

[@uzairjavedakhtar3718]

Thanks A Lot😀

[@nikoufarsiu4833]

excellent

[@uzairjavedakhtar3718]

Thanks A Lot :)

[@SaurabhSrivastava86]

Great explanation !

[@uzairjavedakhtar3718]

Thanks🙂
Keep watching😉

[@yashtibrewal4259]

Hi sir,
I believe you missed out the cases where we have a letter the word ends used more then once in the word. E.g. banana, and then we can have to use # or $. Is there a video in your list for that?
Best,
Yash

[@user-gt1bv3kr1n]

NIce question , I was also looking for that onlyy, in case you have found the answer can you please inform me

[@ankitaakodiya6074]

🔥🔥🔥🔥

[@harshshah9006]

grttttt sirrrr

[@gopalagrawal8378]

sir when u r uploading rest videos?

[@uzairjavedakhtar3718]

As soon as possible.. Right now extremely busy with other commitments

[@MohanKumar-qp2st]

[@pradyumnshirsath7671]

iiitns

[@farinchikate7696]

Muaaz chikate from India

[@uzairjavedakhtar3718]

🖤

[@ChPradeepKumar]

What if a node is having more than 2 children??

[@ChPradeepKumar]

I mean - how to solve "acgactack"?