从尾到头打印链表-python

#输入一个链表的头结点，从尾到头打印每个结点值
#思路：典型的后进先出--可以考虑用栈实现
class ListNode(object):
    def __init__(self,x):
        self.val=x
        self.next=None
node = ListNode(1)
node.next = ListNode(2)
node.next.next = ListNode(3)
node.next.next.next = ListNode(4)
node.next.next.next.next = ListNode(5)
# 思路1：将链表遍历放入数组，之后反转
def ReverseListNode_1(pHead):
	if not pHead:
		return []
	result = []
	while pHead:
		result.append(pHead.val)
		pHead = pHead.next
	result.reverse()
	return result

#思路2：栈思想---先进后出
def ReverseListNode_2(pHead):
	if not pHead:
		return []
	result1 = []
	result2 = []
	while pHead:
		result1.append(pHead.val)
		pHead = pHead.next
	while result1:
		result2.append(result1.pop())
	return result2

#思路3.由于递归也是基于堆栈的--可以考虑用递归实现
#递归依次滑动链表指针，让最前的元素保持在最后
def ReverseListNode_3(pHead):
	if not pHead:
		return []
	return ReverseListNode_3(pHead.next) + [pHead.val]

# print(ReverseListNode_3(node))