#Trie Data Structure# ##What is it?## Implementation of Trie Data Structure to store phone numbers
##Features##
- Efficient way to store Phone Numbers
- Reduces the memory in storing a lot of phone numbers
##Quick Example##
public class TrieTest {
public static void main(String args[]){
Trie object = new Trie(); //Creating a new object for Trie
object.insert("+919003193845","Name1"); //Adding a phone number
object.insert("+919840154116","Name2");
System.out.println(object.search("+919003193845")); //Searching a number
System.out.println(object.search("+919003148927"));
System.out.println(object.getName("+919003193845"));
}
}
##Output##
The output for the above example would be
true
false
Name1