Any skip list L can be converted into binary search tree T(L)as follows: The root of T(L) is considered as the leftmost node on the highest non-empty level of L the left and right sub-trees are constructed recursively from nodes to left and to right of root. Let us call the resulting tree T(L) a skip list tree. Display that any search in T(L) is no more expensive rather than the corresponding search in L.