(Solved) : Asked Use C Implement Binary Tree Traversal Avl Tree Insertion Deletion Submission Contain Q31250397 . . . .

You are asked to use C++ to implement

• Binary Tree Traversal

• AVL Tree Insertion and Deletion

Your submission should contain exactly one file: main.cpp You donot need to submit a design.

There are be different versions of AVL trees. You shouldimplement one where you delete a node with two children, swap thevalue with the largest value on the left.

You should start your program by initializing an empty AVL tree.Your program takes one line as input. The input line contains n“modification moves” separated by spaces (1 ≤ n ≤ 100). Theavailable modification moves are

• Aint (Character A followed by an int value between