Answer the following statements true (T) or false (F)
1. The efficiency of using a binary search tree to implement an ADT dictionary suffers when the tree loses its balance.
2. Numerous additions to and removals from a binary search tree will invariably destroy its balance.
3. You can search an AVL tree almost as efficiently as a minimum height binary search tree.
4. An AVL tree implementation of a dictionary is of equal difficulty to other implementations.
5. It can be proven that the height of an AVL tree with n nodes will always be very close to the theoretical minimum of log2(n + 1).
1. True
2. False
3. True
4. False
5. True
You might also like to view...
An automatic column break in Word aligns text in columns
Indicate whether the statement is true or false
Readability of a document can be improved by using the ________ hyphen feature
Fill in the blank(s) with correct word