题目
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
思路
- 递归的转换左右子树,返回转换后的链表的头结点
- 如果左子树不空,则将左子链表的尾结点连在根节点左侧
- 如果右子树不空,则将右子链表连在根节点右侧
代码
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null) return null;
if(pRootOfTree.left == null && pRootOfTree.right == null) return pRootOfTree;
//将左子树转换为链表,返回头结点,找到左子树链表的最右节点
TreeNode leftNode = Convert(pRootOfTree.left);
TreeNode lastLeft = leftNode;
while(lastLeft != null && lastLeft.right != null)
lastLeft = lastLeft.right;
//如果左子链表不为空,则将最右节点与根节点链接
if(leftNode != null){
lastLeft.right = pRootOfTree;
pRootOfTree.left = lastLeft;
}
//右子树转换后,返回头结点,连接在根节点右侧
TreeNode rightNode = Convert(pRootOfTree.right);
if(rightNode != null){
pRootOfTree.right = rightNode;
rightNode.left = pRootOfTree;
}
//如果有左子树则返回左子链表头结点,如果没有左子树则返回根节点
return leftNode==null?pRootOfTree:leftNode;
}
}