Write a C++ program to insert, delete and print the values in a modified binary search tree which is a dynamically allocated linked list structure. Create the program to read a disk file NUMS.DAT which will contain an unknown number or records. Each record will contain an operation code and a short integer value separated by a blank. The operation codes are I for insert and D for delete. The numeric values can be either negative or positive. When the file is empty, print the values in the tree and terminate the program. The head node pointer will be initialized to NULL when the program begins.