Binary Search C++

Example input and output

i3

i1

i5

i7

oin

1

3

5

7

d7

oin

1

3

5

opre

3

1

5

opost

1

5

3

e

Binary Search Trees Description In this lab your goal is to implement standard operations of binary search trees, including 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 examples 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 following i(key): 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. opre: output all keys via preorder walk. opost: output all keys via postorder walk oin: output all keys via inorder walk. . e: finish your program