2 Correct Answers for the Huffman Tree/Code: (others are possible)
Examples of replacing with smallest in right subtree and largest in left subtree when doing deletion in a BST:
The order that v1 and v6 are declared known could be swapped - you are choosing between adding two vertices both at cost 8 - either is fine. The MST circled is the only correct answer for this graph (it is unique).
Activities we did not have time for and their solutions:
