bidbullbuysellstockstopan -character prefix [ of string of in factfor each character that can follow the prefix [ in string of the set sthere is child of labeled with character in this waya trie concisely stores the common prefixes that exist among set of strings if there are only two characters in the alphabetthen the trie is essentially binary treewith some internal nodes possibly having only one child (that isit may be an improper binary treein generalif there are characters in the alphabetthen the trie will be multi-way tree where each internal node has between and children in additionthere are likely to be several internal nodes in standard trie that have fewer than children for examplethe trie shown in figure has several internal nodes with only one child we can implement trie with tree storing characters at its nodes the following proposition provides some important structural properties of standard trieproposition standard trie storing collection of strings of total length from an alphabet of size has the following propertiesevery internal node of has at most children has external nodes the height of is equal to the length of the longest string in the number of nodes of is (