we had this problem given to us, and i would just like a confirmation as to who is correct on the answer
the stacks S and T are initially empty and we need to say what they would "look like" after these operations
S.push(1)
S.push(2)
T.push(3)
T.push(4)
S.pop
T.GetStackTop(StackTop)
S.push(StackTop)
S.push(5)
T.pop(StackTop)
T.push(6)
I came up with S containing (from bottom to top) 1,4,5
and T containing 3,6
but a friend had only 6 left in T
could someone please specify which is the right solution?