```
function findBin(number) {
let result = []
result.push("1")
for(let i = 0; result.length < number; i++){
let s1 = result[i] + "0"
let s2 = result[i] + "1"
result.push(s1, s2)
}
if (result.length > number) result.pop();
return result;
}
```

Above solution simply uses array push and pop.

Why complicate this question with queue implementation? The only catch here seems to be adding 0 and 1 stuff,