Not quite, you only have one high/low "split" then sequential.
A binary search works like this (generic diagram I found); each comparison splits it upper/lower, so half, quarter, an eight, a sixteenth etc.
You have less than 16 bands, so just four comparisons (at most) to get to a band.
The first comparison is to the mid point of the data set.
Then the mid point of the new subset
Then repeat with each new subset.
so eg. Compare to 14.000
If greater, compare to 24.890 ->
else compare to 7.000 ->
For the >= 24.890 branch, compare to 50.000
If greater its at and end of the tree, compare to 52.000; return 7 if <= else return 0.
If less, compare to 21.000; if greater, compare to 21.450; return 5 if <=,
else compare to 18.068
if less, return 0; else compare to 18.168; return 5 if <= else return 0
And the same type of thing for the 7.000 branch, split it until you get to an end point.
Four comparisons or less get you to any band low frequency, then one more for the band high limit check.
It's almost easier to code it than describe it, once you get the concept.