Algoritm Java - Binary search trees

[Rtrix]

The 15 numbers {1, 2, 3, …, 15} can be stored in a perfectly balanced binary search tree of

height 3. Draw that tree.

Suppose the determination of “bigger, equal or smaller” is counted as one “comparison”. For

each of the above 15 numbers, state how many comparisons are required to determine

whether that number is in the search tree.

Compute the total number of comparisons C required to search for all the numbers, and hence

compute the average number of comparisons A required to search for one number.

Singura chestie pe care nu o stiu este cum sa calculez total number of comparisons si average number( dupa cateva calcule, am ajuns la faptul ca pentru a vedea daca o valoare este sau nu acolo, nr de comparatii e log(n). Putin ajutor pt mai departe?