c++

Create a Binary Search Tree of integer values, then implement the operations: Traverse Inorder Traverse Preorder Traverse Postorder Insert a new item (if the same item already exists, give a message "already exists") Delete an item (if the item does not exists, give a message "item not found") Assumption Each item in the BST is unique. Sample input/output How many integers you want: 5 Enter the integers: 791210 Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 for inserting new item for deleting an item, or 6 for exit the progrm: 4 Enter the item for insert: 2 This item already exists. Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse for inserting new item, 5 for deleting an item, or 6 for exit the program: 4 Enter the item for insert: 8 This item is inserted. Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 fo inserting new item, 5 for deleting an item, or 6 for exit the program:5 Enter the item for delete: 12 This item not found. Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 fo inserting new item, 5 for deleting an item, or 6 for exit the program: 5 Enter the item for delete: 7 This item is deleted. Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 for inserting new item, 5 for deleting an item, or 6 for exit the program: 1 norder Traverse: 128910 Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 for inserting new item, for deleting an item, or 6 for exit the program: 2 Inorder Traverse: 128910 Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 for inserting new item, 5 for deleting an item, or 6 for exit the program: 2 Preorder Traverse: 2198 10 Press 1 for inorder traverse, 2 for preorder traverse, 3 for postol er traverse, 4 for inserting new item, 5 for deleting an item, or 6 for exit the program: 3 Postorder Traverse: 18 10 92 Press 1 for inorder traverse, 2 for preorder traverse, 3 for postorder traverse, 4 for inserting new item, 5 for deleting an item, or 6 for exit the program: 6 Program terminated