Trie Data Structure Explained | Advanced Data Structure | What is Trie | Coding Interview #trie

Hi, in this video we will talk about Trie Data Structure. It is one of the most popular data structures, not just used in the industry but also in interview questions. It is an advanced data structure and questions around auto complete search, prefix based search all use the Trie data structure.

Trie data structure is a tree based data structure to store and efficiently search and retrieve strings. We will also look at all Trie operations like Insert in a Trie data structure, Search in a Trie data structure, Delete from a Trie data structure and discuss Trie data structure complexities.

*TABLE OF CONTENTS*
• 00:00 Introduction
• 01:54 Trie Node
• 03:05 Insert in a Trie Data Structure
• 06:39 Search in a Trie Data Structure
• 09:15 Delete from a Trie Data Structure
• 14:07 Trie Data Structure Time and Space Complexities

*RECOMMENDED VIDEOS*

*FEATURED PLAYLISTS*

*ABOUT THE CHANNEL*
Our channel is about Software and Technical discussions and topics. We cover lots of cool stuff such as System Design, Cloud Computing, Data Structures, Algorithms, Trending Technical Topics, Interview Preparation Tips and much more.
Don’t forget to subscribe!

#trie #datastructures #codinginterview #triedatastructure #codinginterview Subscribe for updates on new videos! #softwaredude

[SoftwareDude]

Comment and let us know if you have any questions.
Like, subscribe and share.

[poojasinha]

Can you share some real world example where Trie is being used or can be used.