C++ Trie Data Structure

Create C++ Program that asks for multiple inputs of weight followed by sentence on each line, and then a prefix/phrase separated by an empty line. The output should be a internal node of highest degree and its children.

In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of search treean ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are not necessarily associated with every node. Rather, values tend only to be associated with leaves, and with some inner nodes that correspond to keys of interest. For the space-optimized presentation of prefix tree, see compact prefix tree.

Hint: Store weights and strings separately.

2 The man ate 5 The man SITS 1 The cat ate 777 This doesn't overlap The Your code should return man SITS man ate cat ate man 2 Root The This man cat doesnt ate sits ate overlap The tree above is a Trie (without weights) for the sentences: The man ate The man sits . The cat ate This doesn't overlap 2 The man ate 5 The man SITS 1 The cat ate 777 This doesn't overlap The Your code should return man SITS man ate cat ate man 2 Root The This man cat doesnt ate sits ate overlap The tree above is a Trie (without weights) for the sentences: The man ate The man sits . The cat ate This doesn't overlap