Question

The scientists want to convert their parent pointer trees into array-storage trees AND compare the storage efficiency. 1. In the file Convert there is a method treeArrayFormat() which accepts a filename and returns the traditional array storage for trees (level order storage). 2. Complete the treeArrayFormat() method. Reuse your code from earlier parts! • How do you do this? There are many ways, but you may want to look back at what you did in Part 1... but remember you have access to java.util here so your code can be different. 3. In the file Convert there is a method arrayLoad() which accepts a tree stored in any type of array format and returns the “load” on the tree. The “load” is the number of “used” array slots divided by the number of total array slots, ignoring “extra empty slots” at the end of the array. 4. Complete the arrayLoad() method.

          The scientists want to convert their parent pointer trees into array-storage trees AND compare the storage efficiency. 1. In the file Convert there is a method treeArrayFormat() which accepts a filename and returns the traditional array storage for trees (level order storage). 2. Complete the treeArrayFormat() method. Reuse your code from earlier parts! • How do you do this? There are many ways, but you may want to look back at what you did in Part 1... but remember you have access to java.util here so your code can be different. 3. In the file Convert there is a method arrayLoad() which accepts a tree stored in any type of array format and returns the “load” on the tree. The “load” is the number of “used” array slots divided by the number of total array slots, ignoring “extra empty slots” at the end of the array. 4. Complete the arrayLoad() method.

Added by John G.

Question

Please give Ace some feedback