这道题,比较容易想到和中序遍历有关,毕竟中序遍历的顺序,即是排序好的二叉搜索树,重点在于如何改变
二叉树的节点指向,这里使用一个前任节点,用来指向当前想成的有序链表的最后一个节点(可以这么理解)。
每次遍历的时候改变指向即可。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
TreeNode head = null;
TreeNode lastHead = null;
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null){
return pRootOfTree;
}
InOrder(pRootOfTree);
return head;
}
private void InOrder(TreeNode pRootOfTree){
if(pRootOfTree == null){
return;
}
InOrder(pRootOfTree.left);
if(null == head){
head = pRootOfTree;
lastHead = pRootOfTree;
}else{
lastHead.right = pRootOfTree;
pRootOfTree.left = lastHead;
lastHead = pRootOfTree;
}
InOrder(pRootOfTree.right);
}
}