CODE IN C++:ACCORDING TO THE QUESTION PLEASE

Q. No. 02: Construct and draw a binary search tree using the following set of numbers {38,13,51,10,12,40,84,25,89,37,66,95} (2) (Points: 12)

1. Write complete code to Insert these numbers in a binary search tree (2)
2. User must be able to search, delete, update and display (2)
3. Implement pre-order,post-order and in-order traversal and display output for each (2)
4. User wants to search 66 sequentially as well as in a binary search tree. How many iterations or passes will each method take? (2)
5. What is the height of tree? Find level and depth of node with number 66? (2)