BEST代写-线上留学生作业代写 & 论文代写专家


C++代写 | C++ Implementation of AVL Trees

C++代写 | C++ Implementation of AVL Trees


1 Task Description
You are asked to use C++ to implement
• Binary Tree Traversal
• AVL Tree Insertion and Deletion
2 Submission Guideline
You must follow this guideline! Your submission will be marked automatically. Failure to
follow this guideline will result in 0.
Your submission should contain exactly 1 le: main.cpp.
You do not need to submit a design.
You should start your program by initializing an empty AVL tree. Your program takes one line as
input. The input line contains n \modi cation moves” separated by spaces (1  n  100). The available
modi cation moves are
• Aint (Character A followed by an int value between 1 and 100): A3 means insert value 3 into the AVL
tree. If 3 is already in the tree, do nothing.
• Dint (Character D followed by an int value between 1 and 100): D3 means delete value 3 into the AVL
tree. If 3 is not in the tree, do nothing.

Your input is then followed by exactly one nishing move (PRE or POST or IN): If the nishing move is
PRE, then you should print out the tree (in its current situation) in pre-order. If the tree is empty, print out
EMPTY. Otherwise, print out the values separated by spaces. POST and IN are handled similarly.
You don’t need to worry about invalid inputs.
Sample input 1: A1 A2 A3 IN
Sample output 1: 1 2 3
Sample input 2: A1 A2 A3 PRE
Sample output 2: 2 1 3
Sample input 3: A1 D1 POST
Sample output 3: EMPTY
3 SVN Instructions
First of all, you need to create a directory under version control:
svn mkdir –parents -m “Creating ADSA Assignment 2 folder”
aXXXXXXX should be your student ID. The directory path needs to be exactly \2021/s1/adsa/assignmentK”,
where \K” is the assignment number. To check out a working copy, type
svn checkout adsa-21-s1-assignment2/
cd adsa-21-s1-assignment2
svn add main.cpp
Commit the les to SVN:
svn commit -m “Adding ADSA assignment 2 main.cpp”
SVN helps keeping track of le changes (over di erent commits). You should commit your work early and