Drawing a decision tree for binary search on an n-element list 

Problem:

        Draw the decision tree for binary search on a sorted list of six elements.  

Solution:        

        The list consists of 

L[1], L[2], L[3], L[4], L[5], L[6]