Quiz Mistake - Trie not considered a graph in the Trie Introduction Quiz

Site Feedback
1

In AlgoMonster: The Most Structured Way to Prepare for Coding Interviews the quiz asserts that a trie is not a graph. Given that a trie is a tree and hence a DAG, it is definitionally a graph.

Perhaps a change in wording or in the answer to make this correct?

2

Also for the trie autocomplete article (Autocomplete) it states “Similar to an actual dictionary, assume that the input will not have any duplicate words.”, however one of the test cases is “cat cat cat”