trie.cpp
void Trie::insertAll(Node *root, vector<int> item_set, int k, int limit, int count) {
    for (int i = 0; i < k; i++) {
        root = insertOne(root, item_set[i], limit - item_set[i]);
    }
    root->count = count;
}
/**
 * given set of items and a parent node insert all the elements at appropriate
 * indices of tree
 *
 * @param root node at which item hierarchy starts
 * @param item_set set of items to be inserted into the tree
 * @param k length of item set
 * @param limit limit on the number of children it can have
 * @param count
 */
given set of items and a parent node insert all the elements at appropriate
indices of tree


given set of items and a parent node insert all the elements at appropriate indices of tree
void Trie::insertAll(Node *root, vector<int> item_set, int k, int limit, int count) {
    for (int i = 0; i < k; i++) {
        root = insertOne(root, item_set[i], limit - item_set[i]);
    }
    root->count = count;
}
void Trie :: insertAll ( Node * root , vector < int > item_set , int k , int limit , int count ) { for ( int i = 0 ; i < k ; i ++ ) { root = insertOne ( root , item_set [ i ] , limit - item_set [ i ] ) ; } root -> count = count ; }
given set of items and a parent node insert all the elements at appropriate
 indices of tree
given set of items and a parent node insert all the elements at appropriate indices of tree