A tree-like data structure where each node represents a letter of a word, with the root node representing the empty string and leaf nodes representing complete words.
A tree-like data structure where each node represents a letter of a word, with the root node representing the empty string and leaf nodes representing complete words.