遇到问题写下来，为了以后方便查啊～

已知前序中序 求二叉树

python 内排序算法

二叉查找树： 左节点<根节点<右节点# 树结构 class Node(object): def __init__(self, value=None, left=None, right=None): self.value = value self.left = left self.right = right

def reverseList(head): if not head or head.next is None: return head pre = None cur = head while cur: tmp = cur.next cur.next = pre