Asking to design a Dictionary Tree without using any Map or hashtable type data structure. Each element is a char. Able to return all the words with tree traversal. At end of each word, there is a token sign or it is end of the branch. The given example is not a binary tree. It has 3 or more branches from the root. Thanks!