Please explain and this is C++

Here is a technique that employs two stacks in order to determine if a phrase is a palindrome, that is, reads the same forward and backward (for example, the word rotator is a palindrome, as is the string rats live on no evil star). Read the characters one by one and transfer them into a stack. The characters in the stack will then represent the reversed word. Once all characters have been read, transfer half the characters from the first stack into a second stack. Thus, the order of the words will have been restored. If there were an odd number of characters, remove one further character from the original stack. Finally, test the two stacks for equality, element by element. If they are the same, then the word is a palindrome. Write a program that takes a string from the user and displays whether or not it is a palindrome using this algorithm