A Practical Introduction to Data Structures and Algorithm Analysis

Sec. 6.7 Exercises 229CAFBEHGDIFigure 6.18 A sample tree for Exercise 6.16.6.17 Draw the binary tree representing the following sequential representation forbinary trees illustrated by Example 6.5:ABD//E//C/F//6.18 Draw the binary tree representing the following sequential representation forbinary trees illustrated by Example 6.6:A ′ /B ′ /C ′ D ′ G/EShow the bit vector for leaf and internal nodes (as illustrated by Example 6.7)for this tree.6.19 Draw the general tree represented by the following sequential representationfor general trees illustrated by Example 6.8:XPC)Q)RV)M))))6.20 (a) Write a function to decode the sequential representation for binary treesillustrated by Example 6.5. The input should be the sequential representationand the output should be a pointer to the root of the resultingbinary tree.(b) Write a function to decode the sequential representation for full binarytrees illustrated by Example 6.6. The input should be the sequentialrepresentation and the output should be a pointer to the root of the resultingbinary tree.(c) Write a function to decode the sequential representation for generaltrees illustrated by Example 6.8. The input should be the sequentialrepresentation and the output should be a pointer to the root of the resultinggeneral tree.6.21 Devise a sequential representation for Huffman coding trees suitable for useas part of a file compression utility (see Project 5.7).