data structure

9. (12 points) List of numbers is given: {3,5,1,2,7,12,65,33, 23,14,55,13}. Build the binary search tree according the given order from the initially empty tree. And compute the search time of entry x=12. (Show the detail.)