class Solution:
def __init__(self):
self.front = None
self.rear = None
def Convert(self, pRootOfTree):
# write code here
if not pRootOfTree:
return None
self.Convert(pRootOfTree.left)
if self.rear == None:
self.front = pRootOfTree
self.rear = pRootOfTree
else:
self.rear.right = pRootOfTree
pRootOfTree.left = self.rear
self.rear = pRootOfTree
self.Convert(pRootOfTree.right)
return self.front
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表
最新推荐文章于 2022-11-08 20:17:39 发布