Trie树_字典树(字符串排序)简介及实现(5)

        }
        for(int i = 0; i < NUM; i++)
        {
            output(node->char_arr[i], str, count);
        }
    }
}