Given a sequence of numbers in sequence

Create a binary search tree and complete the following instructions:

Create a binary search tree and print post-order traversal Print out the post-order traversal of the mirror of the tree After adding a number X, print out pre-order traversal Print the height of the tree Print this tree now has a few nodes Print this tree now has several internal nodes Print out the maximum value in the tree Print the minimum value in the tree After deleting a number Y, print out the pre-order traversal of the two answers (first print out the left subtree and reprint the right subtree minimum, if there is only one answer, the answer is printed twice)

how to write a c++ code for this?