Answer the following statements true (T) or false (F)
1. According to the text, it is natural to make each node an object.
2. In an array-based implementation of a binary tree, the data member free is the index of the index of the first node in the free list. Therefore the next available node will always be at index free + 1.
3. When a node is removed from a tree and returned to the free list, it could be anywhere in the array.
4. According to the text, an array-based implementation of a binary tree is much less attractive when the tree is complete.
5. If you use an array-based implementation of a complete binary tree, you must be sure that the tree remains complete as a result of additions or removals.
1. True
2. False
3. True
4. False
5. True
You might also like to view...
To insert a row using the shortcut menu, ________ the row and then click Insert
A) select B) right-click C) left-click D) double-click
When a user specifies more than one condition in a query, it is called a ________ criteria
Fill in the blank(s) with correct word