doPath(Tree 1)
void * t, tvector<int>& path)
{
if (t == 0) {
for(int k=0; k < path.size(); k++) {
cout << path[k] << " ";
}
cout << endl;
}
path.push_back(t->info);
doPath(t->left,path);
doPath(t->right,path)
path.pop_back(); // remove my footprints
}
2)
void maxfreq(const tvector<string>& codes)
{
int max = 0;
for(int k=0; k < codes.size(); k++){
if (codes[k].length() > max){
max = codes[k].length();
}
}
for(int k=0; k < codes.size(); k++){
if (codes[k].length() == max){
cout << k << endl;
}
}
}
3)
TreeNode * map2tree(tmap<int, string> * map)
// pre: map represents int->string encodings for a Huffman tree
// map contains at least 2 (int, string) pairs
// post: returns pointer to root of Huffman tree representing
// the encodings
{
* TreeNode root = new TreeNode(1234,0,0);
Iterator<pair<int,string> > * it = map->makeIterator();
for(it->Init(); it->HasMore(); it->Next()) {
helper(root, it->Current().second, it->Current().first);
}
return root;
}
4)
n log n
5)
n^2
6)
O(N), must look at entire vector counting
7)
sort, look for where elements differ from predecessor, that's
# unique count, e.g.,
sort(myList.begin(), myList,end());
int count = 0;
for(int k=1; k < myList.size(); k++) {
if (myList[k] != myL...