Problem description: Visit and Support LeetCode Search via Difficulty: Medium Tags: LeetCode, Tree, O(min(n, h)), Medium, Trie, DFS ProblemSolutionCodeProblem