Time complexity using binary search

At 2:38 time stamp perhaps there is alog on both sides i.e. 2^k=N but sir takes somewhat different

Yup correct
2^k =N
log(2^k) ==logN
k==logN