using C++. try to make it easy

Given a list of numbers in sorted order, create a binary search tree. Insert the contents of the binary search tree into an unsorted array. Using the unsorted array, reconstruct the binary search tree. Display the binary search tree in in-order format. Here is an example: The file would look like the following: 5 The binary tree would look like the following The unsorted array would look like The converted binary tree from the unsorted array would look like the following Displaying the above tree in-order format NOTE: NULLS are represented by zeros. The maximum number of elements in the file is 10 Given a list of numbers in sorted order, create a binary search tree. Insert the contents of the binary search tree into an unsorted array. Using the unsorted array, reconstruct the binary search tree. Display the binary search tree in in-order format. Here is an example: The file would look like the following: 5 The binary tree would look like the following The unsorted array would look like The converted binary tree from the unsorted array would look like the following Displaying the above tree in-order format NOTE: NULLS are represented by zeros. The maximum number of elements in the file is 10