Take all the time you need. Don't worry about the commandline, you can create your own input and command files, just copy what's listed here into the files and make sure the output is correct.

Thanks.

I'll post your solution to my group and they will all give a thumbs up.

1. Introduction You will create a C++ program that can build a AVL tree. A list of integers will be given. You need to use the integers to build a AVL tree and traverse or retrieve the data required by the commands. Step by step build your AVL tree, refer to here. https://www.cs.usfca.edu/"galles/visualization/AVLtree.html 2. Input and Output The inputs are regular text file, where each line is terminated with an In' character. 1. There are two files will be given. a) A data file which contains the data which will be used for the AVL tree creating. Definition: A binary search tree, T, is either empty or the following is true: i. T has a special node called the root node. ii. T has two sets of nodes, LT and RT, called the left subtree and right subtree of T, respectively. ii. The key in the root node is larger than every key in the left subtree and smaller than every key in the right subtree. iv. LT and RT are binary search trees. 1. Introduction You will create a C++ program that can build a AVL tree. A list of integers will be given. You need to use the integers to build a AVL tree and traverse or retrieve the data required by the commands. Step by step build your AVL tree, refer to here. https://www.cs.usfca.edu/"galles/visualization/AVLtree.html 2. Input and Output The inputs are regular text file, where each line is terminated with an In' character. 1. There are two files will be given. a) A data file which contains the data which will be used for the AVL tree creating. Definition: A binary search tree, T, is either empty or the following is true: i. T has a special node called the root node. ii. T has two sets of nodes, LT and RT, called the left subtree and right subtree of T, respectively. ii. The key in the root node is larger than every key in the left subtree and smaller than every key in the right subtree. iv. LT and RT are binary search trees