this is data structure class using c++

5. Given the preorder and inorder traversals of a binary tree, you build that binary tree. Preorder: x B GY DE N Inorder: YG DxECN 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 float .35 int .3 while .1 switch.1 for if Draw resulting binary tree