剑指 Offer 36. 二叉搜索树与双向链表
题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的循环双向链表。要求不能创建任何新的节点,只能调整树中节点指针的指向。
解答
/*
// Definition for a Node.
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;
}
};
*/
class Solution {
Node pre,head;
public Node treeToDoublyList(Node root) {
if(root == null){
return null;
}
inOrder(root);
head.left = pre;
pre.right = head;
return head;
}
public void inOrder(Node cur){
if(cur == null){
return;
}
inOrder(cur.left);
if(pre == null){ //代表是中序遍历的第一个节点,即双向链表中的头结点
head = cur;
}else{
pre.right = cur;
cur.left = pre;
}
pre = cur;
inOrder(cur.right);
}
}