balanced binary search trees implement two of the programming problems - in this and then write test program that generates random list of integers time inserting the values into the first implementation and then time inserting each value into the second implementation record all times in the xml format needed by the plotdata py program from two plot the timing of the two algorithms to compare their relative efficiency write splay tree implementation with recursive insert and lookup functions implement an avl tree either iteratively or recursively where the height of each node is maintained run test where trees are built from the same list of values when you generate the list of valuesduplicate values should be considered lookup write the data file with an or an followed by value which indicates either lookup or insert operation should be performed generate an xml file in the format used by the plotdata py program to compare your performance results write splay tree implementation with recursive insert and lookup functions compare it to one of the other balanced binary tree implementations detailed in this run test where trees are built from the same list of values when you generate the list of valuesduplicate values should be considered lookup write the data file with an or an followed by value which indicates either lookup or insert operation should be performed generate an xml file in the format used by the plotdata py program to compare your performance results this copy belongs to 'acha