LeetCode #426 - Convert Binary Search Tree to Sorted Doubly Linked List

题目描述：

Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to 

the previous and next pointers in a doubly-linked list.

Let's take the following BST as an example, it may help you understand the problem better:

We want to transform this BST into a circular doubly linked list. Each node in a doubly linked list has a predecessor and successor. For a circular doubly linked list, the predecessor of the first element is the last element, and the successor of the last 

element is the first element.

Specifically, we want to do the transformation in place. After the transformation, the left pointer of the tree node should point to its predecessor, and the right pointer should point to its successor. We should return the pointer to the first element of the linked list.

The figure below shows the transformed BST. The solid line indicates the successor relationship, while the dashed line means the predecessor relationship.

class Solution {
public:    
    Node* pre;//全局变量保留inorder遍历的上一个节点
    
    Node* treeToDoublyList(Node* root) {
        if(root == NULL) return NULL;
        Node* head = new Node(0, NULL, NULL);
        pre = head;
        inorder(root);//在inorderd第一步中，由于pre=head，所以pre->left=node_1，即head->right=node_1
        pre->right = head->right;
        head->right->left = pre;
        return head->right;
    }
    
    void inorder(Node* root)
    {
        if(root == NULL) return;
        inorder(root->left);
        pre->right = root;
        root->left = pre;
        pre = root;
        inorder(root->right);
    }
};