when we calculate space complexity then we consider only auxilary space taken by an algo. It's because input space will remain same for all algorithms.
for B.S recurrence relation is T(n) = T(n/2) + 1 so space complexity and time complexity both will be same as in worst case there can be logn recursive calls.
PS: I don't know what does this 'B' ,mean