This question is to be solved in C++

5. Write a function list2tree(list) that converts a list into a binary search tree and returns a pointer to the constructed tree. The nodes of the binary search tree should be allocated dynamically. Write a small program that takes elements from a user, inserts them into a list, and then when the user is done inputting elements, calls the list2tree(list) function to create the binary tree, and displays the in-order, pre-order, and post-order traversals of the created tree. (You can use a vector, an array, or a linked list to represent your list)