this is in C++

5. (2 points) Construct a Huffman trie based on the following distribution of letters. When combining two trees, always place the smaller on the left. 6. (2 points) Show that for any leaf v in a binary search tree, if u is the parent of v, then either key[v] is the largest key in the tree smaller than key[u], or key[v] is the smallest key in the tree larger than key[u]. (Heileman, p.216)