1. 题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
2. 解题思路
(1)要充分利用递归思想,把每个左右指针改向。遍历双向链表,然后返回头结点。
(2)。。。
3. 代码实现
(1)
public class Solution {
public TreeNode Convert(TreeNode pRootOfTree) {
TreeNode lastlist = covertNode(pRootOfTree, null);
TreeNode pHead = lastlist;
while (pHead != null && pHead.left != null){
pHead = pHead.left;
}
return pHead;
}
private TreeNode covertNode(TreeNode root, TreeNode lastlist) {
if (root == null)
return null;
TreeNode cur = root;
if (cur.left != null){
lastlist = covertNode(cur.left, lastlist);
}
cur.left = lastlist;
if (lastlist != null){
lastlist.right = cur;
}
lastlist = cur;
if (cur.right != null){
lastlist = covertNode(cur.right, lastlist);
}
return lastlist;
}
}
(2)
.。。。