Instructions:

Initial AVL Tree Construction:

Insert the following nodes into an AVL Tree in the given order:

$33,13,53,11,21,61,8$

Draw the AVL Tree diagram $($with hand$-$drawing or using a tool like Notepad, Paint, or any diagramming software$)$ after all the insertions.

Save the diagram as an image or a text$-$based representation and include it in your submission.

Insert a New Node:

$3$

Insert the node $9$ into the AVL Tree.

Rebalance the tree as necessary and redraw the AVL Tree diagram after this insertion.

Include the in$-$order and pre$-$order traversals of the tree in your submission.

Delete a Node:

Delete the node $13$ from the AVL Tree.

Rebalance the tree as necessary and redraw the AVL Tree diagram after this deletion.

Include the in$-$order and pre$-$order traversals of the tree in your submission.

Search for a Node:

Search for the node $11$ in the AVL Tree.

If the node is found, write:

Key $11$ found in the tree.

If the node is not found, write:

Key $11$ not found in the tree.

Code Imolementation: