In C++

Binary Search Trees Description In this lab your goal is to implement standard operations of binary search trees, inchuding insert and delete. See section 12.3 in the textbook. There 're millions of ways of implementing delete operation, but you must follow eractly the same algorithm in the tertbook. In this assignment the keys are integers. Your code will be tested for exampks consisting of distinct keys. In the input, each starts with 'e', i', "d', 'oin', opre', or 'opost'. For each line, you will have to do the folloming. eikey): Insert (key) into the BST. For example, i2 implies Insert key 2 into the BST. d(key): delete (key) from the BST-For example, d2 implies .delete key 2 from the BST." Do nothing if the BST doesn't have the key. eopre: output all keys via preorder walk. opost: output all keys via postorder walk. oin: output all keys via inoeder walk. e: finish your program. Example input and output The following example shows an execution of the program in interactive mode. See the input files and output files under the testfiles folder for examples where input and output are separated. 13 i1 i5 d7 opre opost