题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
解题思路
1.正常递归解法(Java)
//中序遍历不断连到当前链表尾
public class BSTConvertToList {
TreeNode curtail = null;
TreeNode res = null;
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null){
return null;
}
Convert(pRootOfTree.left);
if(curtail == null){ //对于刚刚开始的时候 也就是最左节点
curtail = pRootOfTree;
res = pRootOfTree; //res保存头结点,不再改变!
}else{
curtail.right = pRootOfTree;
pRootOfTree.left = curtail;
curtail = pRootOfTree;
}
Convert(pRootOfTree.right);
return res;
}
}
2 投机取巧的不太靠谱的非正常解法 Python
class Solution:
def Convert(self, pRootOfTree):
# write code here
if pRootOfTree == None:
return None
self.res=[]
self.mid_order(pRootOfTree)
for i in range(len(self.res)-1):
self.res[i].right=self.res[i+1]
self.res[i+1].left=self.res[i]
return self.res[0]
def mid_order(self,pRootOfTree):
if pRootOfTree == None:
return
# print(tree.get_data())
self.mid_order(pRootOfTree.left)
self.res.append(pRootOfTree)
self.mid_order(pRootOfTree.right)