How can I create an indexed binary tree from a sorted list in Haskell?

Question

I am trying to make a tree out of a sorted list so that I can search it later.

The problem is

I have to return the index of the number if it is found else I retu