What is an AVL tree?
a. It's a self-balancing binary search tree, in which the difference between the heights of the left and right subtrees cannot be more than one for all nodes
b. It's a different name for a balanced search tree
c. It is a binary search tree with an additional bit to store information about the node color
d. All of the above
a. It's a self-balancing binary search tree, in which the difference between the heights of the left and right subtrees cannot be more than one for all nodes
You might also like to view...
Which views of the character are the most important ones to use as references for modeling?
A. Front, side, back B. Front, top, back C. Front, side, top, bottom, and back D. Front only
Which of the following server types requires the LARGEST amount of available hard drive space?
A. Database server B. Remote access server C. Print server D. Directory server