题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
Solution
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
/*
因为要转换成排序的双向链表,所以采取中序遍历的方式
*/
public class Solution {
TreeNode lastNode = null;
TreeNode headNode = null;
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null) return null;
Convert(pRootOfTree.left);
///第一次运行时,它会使最左边叶子节点为链表第一个节点
if(lastNode == null){
headNode = lastNode = pRootOfTree;
}else{
pRootOfTree.left = lastNode;
lastNode.right = pRootOfTree;
lastNode = pRootOfTree;
}
Convert(pRootOfTree.right);
return headNode;
}
}