Implement Trie Insert and Exact-Word Search

## Problem Implement a trie that supports `insert(word)` and `search(word)`. Insert adds a lowercase word. Search returns true only when the complete word was previously inserted; a stored word merely sharing the requested prefix is not a match. Process a sequence of operations and return the results of all searches. ### Constraints & Assumptions - There are at most 200,000 operations. - Every word has length between 1 and 1,000. - The total number of characters across all operations is at most 1,000,000. - Words contain lowercase English letters. ### Clarifications - Inserting the same word repeatedly is allowed and has no additional effect. - A node must distinguish an inserted word ending there from a prefix only. - Return booleans in the same order as search operations appear. ### Examples ```text operations = [insert("apple"), search("apple"), search("app"), insert("app"), search("app")] output = [true, false, true] ``` ### Hints ```hint Represent prefixes Each edge consumes one character and each node represents the prefix along its path. ``` ```hint Mark complete words Reaching the final character is not enough unless the terminal node records an insertion. ```