Part $2,$ likely handwritten,

$1.$ Draw an execution tree for the getParent$()$ routine for the following tree of data $($using your code$).$ Look for the object holding $"$tttt$".$ Show all function calls and relevant information at each call. $($Recall the getParent$()$ is written for a general binary tree, not a binary search tree.$)$

iii not tttt eee r and jj pp sssss ooo ff m y z

$2.$ Use Huffman coding to encode these symbols with given frequencies:

a: $0\mathrm{.}10$

b: $0\mathrm{.}25$

c: $0\mathrm{.}05$

d: $0\mathrm{.}15$

e: $0\mathrm{.}30$

f: $0\mathrm{.}07$

$\backslash (\backslash$mathrm$\{$g$\}$: $0\mathrm{.}08\backslash )$

$3.$ Build $($draw$)$ a heap $($smallest value at root$)$ by inserting one item at a time with the values:

$4.$ Build $($draw$)$ a heap $($smallest value at root$)$ using the linear algorithm with the values:

$5.$ What happens if you post assignment code on the web during or after the course ends?

You can find other practice problems $($with solutions$)$ linked off the Course Notes$/$Practice Problems page.