Given a binary tree with the following dadta: g,d,r,s,b,q,c,m
What is the average number of comparisons done to search for an item that is known to be in the list using binary tree search? (Hint: Find the number of comparisons for each of the items.) Show work