Trie
Trie is a tree-based data structure that stores a set of strings. Each node has the same number of pointers as to the number of characters in the alphabet. It is extracted from the word "retrieval," as words and strings can be retrieved from the structure by traversing down a branch path of the tree. In computer science, it is also called a digital tree or prefix tree.
Introduction and Implementation
The basic Trie operations are: Insertion of a node. Searching of a node. Deletion of a node. Here is the implementation of the Trie data structure with these operations.
Introduction and implementation of Trie
By Nishant Rana
● Published At Oct 2021
This blog will cover the theory, implementation, discussion over time complexity and space complexity of Trie data structure. ... Keep reading ..
Trie - Insertion and Search
By Pradipta Choudhury
● Published At Apr 2022
This article covers the trie insertion and search operation, its implementation in C++, a discussion around its time, space complexity, and the advantages of tries. ... Keep reading ..
Dictionaries using Tries
By Husen Kagdi
● Published At Oct 2021
This blog introduces you to one of the fascinating data structures, Tries. We will learn how to implement dictionaries using tries.... Keep reading ..
Delete nodes from trie
By Sneha Mallik
● Published At Jan 2022
This blog covers deleting nodes from trie and covers the basic concepts of trie, code and algorithm of trie operations.... Keep reading ..
Advantages of Trie Data Structure
By Rhythm Jain
● Published At Dec 2021
This article discusses the importance and advantages of Trie Data Structure.... Keep reading ..
Problems
With the help of Trie, we can solve different problems like 1. Longest Prefix Matching 2. Print unique rows in a given boolean matrix 3. Implementation of reverse DNS Lookup Cache and Forward DNS Lookup Cache 4. Implementing Fenwick Tree and much more...
Pattern Searching using Trie
By Pranav Gautam
● Published At Oct 2021
Implement pattern searching using a trie. Create a suffix tree using all possible suffixes of a given string. ... Keep reading ..
Longest word in dictionary
By Pranav Gautam
● Published At Nov 2021
Learn to find the longest word in a dictionary with all the prefixes present as words in the dictionary. ... Keep reading ..
Implement Forward DNS Look Up Cache
By Aditya Narayan Mishra
● Published At Jan 2022
This article is based on DNS caching and how to implement forward DNS look up cache using the Trie data structure.... Keep reading ..
Implement Reverse DNS Look Up Cache
By Aditya Narayan
● Published At Jan 2022
This article is based on DNS caching and how to implement reverse DNS look up cache using the Trie data structure.... Keep reading ..
puzzle icon

Top Problems related to Trie