QUESTION 3 Assume an array-based implementation of the following binary tree whe

Question

QUESTION 3 Assume an array-based implementation of the following binary tree where position 0 is the root node. Give the array with the computed positions of each node. Use NULL if the position in the array does not contain a node. What problem with array based tree implementations does this array illustrate? 10 Words:0 Path: p

Explanation / Answer

Array representation for the tree is -> 7, 6, 10, NULL, NULL, 8, NULL, NULL, NULL, NULL, NULL, NULL, 9 As we can see there are many elements of the array with NULL values. So, memory usage is very high for this implementation of tree. That's the problem this implementation illustrate!

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---