题目描述:输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的循环双向链表。要求不能创建任何新的节点,只能调整树中节点指针的指向。
例:
二叉搜索树:
转化成的链表:
思路:
二叉搜索树的中序遍历是有序的,所以只需将二叉搜索树的中序遍历代码中输出的部分改为链表的尾插即可。
Java代码:
class Node {
public int val;
public Node left;
public Node right;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val,Node _left,Node _right) {
val = _val;
left = _left;
right = _right;
}
}
public class Solution {
private Node head;
private Node last;
public Node treeToDoublyList(Node root) {
if(root==null){
return null;
}
head = null;
last = null;
inorder(root);
head.left = last;
last.right = head;
return head;
}
private void inorder(Node node) {
if (node != null) {
inorder(node.left);
// 进行尾插
if (last != null) {
last.right = node;
} else {
head = node;
}
node.left = last;
last = node;
inorder(node.right);
}
}
}