Use Java as Programming Language

1. Using AVL Tree, ILLUSTRATE the following procedures. The method is continuous: (/2.5)

A. INSERT 89, 67, 56, 90, 43, 98, 23, 10, 18, 79 (0.5 PTS)

B. DELETE 43 (0.5 PTS)

C. DELETE 79 (0.5 PTS)

D. INSERT 80, 100, 120 (0.5 PTS)

E. DELETE 100 (0.5 PTS)

2. Using the final result of AVL tree in III.1, do/find/list the following: Insertion or deletion is continuous.

A. Inorder traversal (1PT)

B. Postorder traversal (1 PT)

C. Preorder traversal (1 PTS)

D. Insert 20 (0.25 PTS)

E. Insert 200 (0.25 PTS)

F. Root node (0.25 PT)

G. Leaf nodes (0.25 PT)

H. Children (0.25 PT)

I. Internal nodes (0.25 PT)

J. Parent node (0.25 PT)

K. Height of the tree (0.25 PT)

L. Level of the tree (0.25 PT)

M. Maximum degree of the tree (0.25 PT)

N. Number of nodes (0.25 PT)

O. Write a name at the root of the tree (1 PT)