Challenge: Find All Words Stored in Trie

Statement

Given a trie data structure representing a list of words, implement a function that finds and returns all words stored in the trie.

Constraints:

• $0\leq$ words.length $\leq 10^3$

• $1\leq$ words[i].length $\leq10^2$

• All words[i] consist of lowercase English letters.

Examples