C++

Enter e string through the keyboard (for end press Ctrl+A) and declare an empty stack and an empty queue. For each character in the string, if it is a lowercase, enter (push) it into the stack, otherwise enter (enqueue) it in the queue. Print both the stack and the queue. Then, pop all the lowercase characters one by one from the stack and enter them in the queue. Once again print both the stack and the queue.

Note:use the function islower(character)to get trueif the character is a lowercase, or false otherwise.

Example output:

Enter the string (for end press Ctrl+A):

This is a string^A

After pushing the lowercase characters in the stack, and all the other characters in the queue, the output is:

stack:

g -> n -> i -> r -> t -> s -> a -> s -> i -> s -> i -> h -> NULL

queue:

T -> -> -> -> NULL

After entering the lowercase characters in the queue, the output is:

stack:

NULL

queue:

T -> -> -> -> g -> n -> i -> r -> t -> s -> a -> s -> i -> s -> i -> h -> NULL

Press any key to continue ...