Data Structures and Algorithm Analysis - Computer Science at ...

192 Chap. 5 Binary Trees(c) What is the average number of bits required by a character using theHuffman code for this alphabet?5.32 You must keep track of some data. Your options are:(1) A linked-list maintained in sorted order.(2) A linked-list of unsorted records.(3) A binary search tree.(4) An array-based list maintained in sorted order.(5) An array-based list of unsorted records.For each of the following scenarios, which of these choices would be best?Explain your answer.(a) The records are guaranteed to arrive already sorted from lowest to highest(i.e., whenever a record is inserted, its key value will always begreater than that of the last record inserted). A total of 1000 inserts willbe interspersed with 1000 searches.(b) The records arrive with values having a uniform random distribution(so the BST is likely to be well balanced). 1,000,000 insertions areperformed, followed by 10 searches.(c) The records arrive with values having a uniform random distribution (sothe BST is likely to be well balanced). 1000 insertions are interspersedwith 1000 searches.(d) The records arrive with values having a uniform random distribution (sothe BST is likely to be well balanced). 1000 insertions are performed,followed by 1,000,000 searches.5.9 Projects5.1 Re-implement the composite design for the binary tree node class of Figure5.11 using a flyweight in place of null pointers to empty nodes.5.2 One way to deal with the “problem” of null pointers in binary trees is touse that space for some other purpose. One example is the threaded binarytree. Extending the node implementation of Figure 5.7, the threaded binarytree stores with each node two additional bit fields that indicate if the childpointers lc and rc are regular pointers to child nodes or threads. If lcis not a pointer to a non-empty child (i.e., if it would be null in a regularbinary tree), then it instead stores a pointer to the inorder predecessor of thatnode. The inorder predecessor is the node that would be printed immediatelybefore the current node in an inorder traversal. If rc is not a pointer to achild, then it instead stores a pointer to the node’s inorder successor. Theinorder successor is the node that would be printed immediately after thecurrent node in an inorder traversal. The main advantage of threaded binary