sec tries figure the binary trie for the collection of values all data values are stored in the leaf nodes edges are labeled with the value of the bit used to determine the branching direction of each node the binary form of the key value determines the path to the recordassuming that each key is represented as -bit value representing number in the range to binary numbersthe alphabet is { and binary trie results other alphabets lead to other branching factors one application for tries is storing dictionary of words such trie will be referred to as an alphabet trie for simplicityour examples will ignore case in letters we add special character ($to the standard english letters the character is used to represent the end of string thusthe branching factor for each node is (up to once constructedthe alphabet trie is used to determine if given word is in the dictionary consider searching for word in the alphabet trie of figure the first letter of the search word determines which branch to take from the rootthe second letter determines which branch to take at the next leveland so on only the letters that lead to word are shown as branches in figure (bthe leaf nodes of the trie store copy of the actual wordswhile in figure (athe word is built up from the letters associated with each branch one way to implement node of the alphabet trie is as an array of pointers indexed by letter because most nodes have branches to only small fraction of the possible letters in the alphabetan alternate implementation is to use linked list of pointers to the child nodesas in figure the depth of leaf node in the alphabet trie of figure (bhas little to do with the number of nodes in the trie rathera node' depth depends on the number of characters required to distinguish this node' word from any other for exampleif the words "anteaterand "antelopeare both stored in the trieit is not until the fifth letter that the two words can be distinguished thusthese words must be stored at least as deep as level five in generalthe limiting factor on the depth of nodes in the alphabet trie is the length of the words stored