c++ please

Objectives: - Practice use of time libraries to analyze runtimes - Practice altering and extending existing code base to meet new criteria - Better understand usage of BSTs and AVLs Assignment: The goal of this assignment is to create various test setups to analyze the various pros and cons of several of our Data Structures. The structures used in this program are Linked Lists, Binary Search Trees, and AVL Trees. The majority of the codebase is already setup with two sample tests. The assignment will require the creation of several more tests such as timings for creations of Data Structures, searching for various amounts of elements within Data Structures, and analyzing how much better a particular structure is at one goal compared to another. In addition to creating the tests, there will also be questions testing the knowledge of what is happening and why it is happening. The tests and questions will be located in a separate document. For this assignment, I highly suggest using the following line to compile the code. There are several files, and the c++11 standard will be required. Using *.cpp grabs every cpp file in your directory, so do be careful if using this in the future. Endeavouros | fsh | [03:38:15] devin e devin-endeavour-7950x in Course-DataStruct/Tining clang ++- std =c++11 *.cpp EndeavouroS | fsh | [03:38:49] devin e devin-endeavour-7950x in Course-DataStruct/Tining ./a.out =me Test 1 =ma 2: 21351 Hs / Value Count: 63267 3: 21222s | Value Count: 63322 4: 21471 Hs | Value Count: 63342 5: 21180S | Value Count: 63178 6: 21563 Hs I Value Count: 63181 7: 21226 ps | Value Count: 63268 8: 21439s | Value Count: 63124 9: 21825s | Value Count: 63263 ==e Test 1 === 2: 21351 us | Value Count: 63267 3: 21222 Hs | Value Count: 63322 4: 21471 us | Value Count: 63342 5: 21180 us | Value Count: 63178 6: 21563 us | Value Count: 63181 7: 21226 ps | Value Count: 63268 10: 21540 Hs | Value Count: 63132 man Test 2 mm LL: 551229s BST : 1708s AVL: 1426s