Trie

Implemented a trie data structure using recursive programming.

A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) sub-tree is not a null sub-tree, it represents a string that is the concatenation of string represented by the parent and the kth letter of the alphabet (where a is the 0th letter, b is the 1st letter, and so on). Each node may or may not indicate that it is a terminal entry for a word. While a trie could be used to store hyphenated and capitalized words together with those with apostrophes, we will restrict ourselves to words made up of the twenty-six letters of the English alphabet.

Copyright (c) 2017 Gunin Khanna:

-Trie.h -Trie_node.h -test_files

Built With

• c++