Reference no: EM13166705
To get some practice with AVL Trees. As a compromise, he's decided that it's good enough if the students just implement the insert function instead of both the insert and delete. To make his assignment easy to grade, he'll simply give students a sequence of inserts to perform and then ask the students to output a pre-order traversal after each insertion to make sure that the structure of the tree is correct.
In Computer Science I, you implemented a regular binary search tree. Due to your busy schedule, you've decided that it would be best if you could simply reuse this code without any changes. You realize that your code would ONLY work for Arup's assignment on the cases where NO rebalancing or rotations occur. Thus, you've come up with a nefarious plan. You will infiltrate Arup's office by bribing the janitorial staff, steal his test cases and remove all of the cases where a rebalancing would have been required.
For this program, read in a sequence of inserts into an AVL tree and simply determine if performing those inserts ever requires a rebalancing. If so, print out "REMOVE", otherwise print out "KEEP".
Input
The first line of input will contain a single positive integer, T (T ? 100), the number of input cases. The following T lines will contain each of the test cases, one test case per line. For each test case, the first integer on the line, n (n < 1024), will represent the total number of inserts for the test case. The following distinct n positive integers on the line represent the values to insert into the AVL tree, in the order that they are given. All of these values will be separated by a space. (There may or may not be a space at the end of each of these lines.)
Output
For each test case, start the output with a header of the following form:
Tree #k:
where k is the number of the test case, starting with 1.
Follow this with a space and either the string "REMOVE" or "KEEP", based on the cases described above.
Sample Input
2
3 1 2 3
7 4 2 6 7 3 1 5
Sample Output
Tree #1: REMOVE
Tree #2: KEEP
|
Determine the specific heat of the metal bar
: the temperature of a metal bar rises by 15 C when it absorbs 4.26 kJ of heat. The mass of the bar is 472g. Determine the specific heat of the metal bar.
|
|
Explain how many grams of chlorine gas are needed
: How many grams of chlorine gas are needed to react with 11.5 grams of sodium metal
|
|
Kind of magnetic ordering would predict
: Predict whether each of the following should form a normal or inverse spinel (hint: think about CFSE's): MgV2O4, VMg2O4, NiGa2O4, ZnCr2S4, NiFe2O4, Mn3O4, Fe3O4
|
|
Compute an approximate atomic radius for copper
: The coinage metals-copper, silver, and gold-crystallize in a cubic closest packed structure. Use the density of copper (8.95g/cm3) and its molar mass
|
|
Implemented a regular binary search tree
: In Computer Science I, you implemented a regular binary search tree. Due to your busy schedule, you've decided that it would be best if you could simply reuse this code without any changes. You realize that your code would ONLY work for Arup's ass..
|
|
Follow the projects suggestion
: Be sure that you follow the projects suggestion and create a separate class for the word analysis. An instance of this class and its methods should then be called by your GUI interface.
|
|
What do the density or potential plots demonstrate
: What do the density/potential plots demonstrate about bond order?
|
|
Need help with writing prototype functions
: Need help with writing prototype functions: For this assignment, you must write pseudocode and C code for several sub-functions that use pointers and arrays, and a main() function that calls your sub-functions, printing the specified values
|
|
Design a memory management scheme
: Design a memory management scheme for a 64 bit architecture, using various types of paging and/or segmentation available. Then highlight its advantages and disadvantages. Your scheme must be different from your colleagues' schemes.
|