For data structures and algorithm:

Preferably hand drawn but doesn't have to be. Thank you so much!!

6. Construct the Hoffman code for the C++keywords given below for which the expected length of the bit string for each keyword is minimal. The weights of the keywords are given below in the table Words Weights return.15 switch .15 while .2 if for .25 45 Draw resulting binary tree Answer: Write the Hoffman codes for the words in this table. Words Weights Hoffman Code return .1 switch.15 while .2 if for 5 .25 45 Decode the following Hoffiman code: 0100111000001