Zoho Associate Developer Interview Question 2025 February | Tries | on-campus

Question 1: Implement Trie (Prefix Tree) Problem Statement A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. Implement the Trie class with the following methods: Trie() — initializes the trie object void insert(String word) — inserts the string word into the trie boolean search(String word) — returns true if the string word is in the trie (exact match), false otherwise boolean startsWith(String prefix) — ...