def queue_to_stack(my_queue):
q = deepcopy(my_queue)
s = LinkedStack()
while not q.isEmpty():
s.add(q.peek())
q.pop()
return s
def _is_palindrom(word):
ls = LinkedStack()
for i in range(len(word) // 2):
ls.add(word[i])
md = len(word) // 2 if len(word) % 2 == 0 else len(word) // 2 + 1
for i in range(md, len(word)):
if ls.pop() != word[i]:
return False
return True
