Implement a trie (prefix tree) with insert(word) , search(word) (exact match), and startsWith(prefix) . Trie() constructs it. Input format Operation names + parallel argument lists, e.g. [[ Trie , insert , search ],[[],[ apple ],[ apple ]]] .