Notes, hints, and assumptions

• We have provided the main algorithm, a routine that generates subsets, and other class prototypes for HashTree in the directory www.rpi.edu/dept/cs/cs230/public/projects/project3.
• You will need to ``rewind'' the input file after you have counted the frequency of word-sets in an iteration. Do this using fd.clear(); and fd.seekg(0); where fd of type ifstream.
• Use the leaf threshold value T=2. If a leaf has more than T items then it will be converted into an internal node. The only exception is if the tree is already at the maximum depth. In this case, the leaf may hold more than T word-sets.