Inroduction To Trie
In this video, I have introduced Trie data structure.
A trie is a tree data structure used to efficiently store and reTRIEve keys in a dataset of strings.
It is also known as a prefix tree as all descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.
https://github.com/fit-coder/fitcoder...
00:00 Introduction
00:06 Trie
02:37 Node of Trie
05:08 Insert word in Trie
08:47 Print words in Trie
13:08 Applications of Trie
15:35 C++ Implementation
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For Sorting Algorithms, please refer to the below playlist:
• Sorting Algorithms
For Linked List tutorials, please refer to the below playlist:
• Linked List
For Binary tree tutorials, please refer to the below playlist:
• Tree Data Structures
For Binary search tree tutorials, please refer to the below playlist:
• Binary Search Tree
For in-depth Graph theory and implementation details, please refer to the below playlist:
• Graph Algorithms
#DataStructure,#sorting,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview