AVL Tree using JAVA

:

You are required to develop an AVL tree (

class AvlNode)

to support the following

operations

Find method

:

returns the node that contains the value indicated by the input

parameter;

Insert method:

insert the specified value into the AVL tree;

Remove method: remove the specified value from the AVL tree;

Inorder traversal method.

Testing data

You may test your program by do the following:

Insert 3, 2, 1, 4, 5, 6, 7, 16,

15, 14, 13, 12, 11, 10, 8, 9 into an initially empty AVL

tree, then

print the tree using Inorder traversal;

Remove 9, 6, 1, 3, then print the tree using Inorder traversal.