Print binary number with Queue

Given the number of digits generate a binary number of that length.

loop_invariant

• NOTE: The pop operation on list, tuple in Python can be different than how it looks.

def generate_print_binary(n):
    q = []
    q.append("1")
 
    while n > 0:
        n -= 1
        f = q[0]
        q.pop(0)
        print(f)
 
        g = f
 
        q.append(f + "0")
        q.append(g + "1")
		
 
generate_print_binary(5)
 

// function to generate binary numbers
function generatePrintBinary(n)
{
	// Create an empty queue of strings
	var q = new Queue();
		
	// Enqueue the first binary number
	q.enqueue("1");
		
	// This loops is like BFS of a tree with 1 as root
	// 0 as left child and 1 as right child and so on
	while(n-- > 0)
	{
		// print the front of queue
		var s1 = q.front();
		q.dequeue();
		console.log(s1);
			
		// Store s1 before changing it
		var s2 = s1;
			
		// Append "0" to s1 and enqueue it
		q.enqueue(s1 + "0");
			
		// Append "1" to s2 and enqueue it. Note that s2 contains
		// the previous front
		q.enqueue(s2 + "1");
	}
}
 
// calling the above function	
// prints [1 10 11 100 101]
generatePrintBinary(5);