the question is:
Write a method with the signature:
public static void printABs(int n)that prints all the strings, less than or equal to length n, that can be built from the alphabet A,B. printABs must print out its strings
starting from the shortest strings and ending in the longest. So, for
example, the call:
we can use the queue interface method such as empty front remove add.and this question is supposed to use queue.
ive no idea how to start off with this,it kinda permutation thing,but how can a queue do this?need help...!