剑指 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 head, tail;
    public Node treeToDoublyList(Node root) {
        if(root == null)
            return root;
        inorder(root);
        head.left = tail;
        tail.right = head;
        return head;
    }
    public void inorder(Node root){
        if(root == null){
            return;
        }
        inorder(root.left);
        if(tail == null)
            head = root;
        else{
            tail.right = root;
            root.left = tail;
        }
        tail = root;
        inorder(root.right);
    }
    
}