题目描述:给你一个二叉搜索树,在不产生新的节点的情况下,将其变为一个有序的双向链表
思路:递归。
1,将左子树变为双向链表,返回左子树头节点
2,获得左子树最大的那个节点,将其与根节点链接
3,将右子树变为双向链表,返回右子树头节点
4,右子树头节点与根节点链接
5,若左子树不为空就返回左子树头节点,否则返回根节点
java程序:
/**
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 left = Convert(pRootOfTree.left);
TreeNode p = left;
while(p!=null&&p.right!=null)
p = p.right;
if(left!=null){
p.right = pRootOfTree;
pRootOfTree.left = p;
}
TreeNode right = Convert(pRootOfTree.right);
if(right!=null){
pRootOfTree.right = right;
right.left = pRootOfTree;
}
return left==null?pRootOfTree:left;
}
}