Solution: 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 $\le 1$ ...