Given seven integers, 1, 2, 3, 4, 5, 6, and 7, draw a binary search tree that is as balanced as possible. Draw the tree using plain text as in the following example.

To rebalance an AVL tree, we can use either the cut/link restructuring algorithm or the tri-node restructuring algorithm. Which of the following statements is true?

a. The tri-node restructuring algorithm has better running time.

b. None of the statements

c. The two algorithms result in different AVL trees.

d. The cut/link algorithm has better running time.

Restructuring an AVL tree incurs a running time of

a. O(1)

b. O( n )

c. O( h ), where h is the height of the tree.

d. O(nlogn)

e. O(logn)

This type of rotation is a

a. Triple rotation

b. Single rotation

c. Double rotation

d. Cut/link restructuring

What is the running time of the remove/delete operation in an AVL tree? Select the best answer.

a. O( n )

b. O(logn)

c. O(nlogn)

d. O(1)

e. O( h ), where h is the height of the tree.

A 7 B / D E F G a=z b=X c=y a=z c=y b=x Ti T4 Ti T2 T3 T4 T2 T3