a balanced binary tree contains $350$ elements $.$ what is the maximum number of comparisons necessary to find an element in the tree?

a$)7$

b$)350$

c$)9$

d$)1$