The document shows the step-by-step process of inserting words into a trie data structure. Each letter of each word is inserted as a node in the trie, with pointers added between nodes to represent the structure of the words. The words {"she","shell","see","shore","selling","sell"} are inserted into an initially empty trie.