题目要求把一棵二叉搜索树转换成一个循环双向链表。具体要求是一个节点的左指针left指向其前继（predecessor）,右指针right指向后继（successor）。最后头节点的left指向尾节点，尾节点的right指向头节点。如果熟悉前继和后继的概念就会知道最后链表是排好序递增的，其实就是二叉搜索树的中序遍历的顺序。很显然又是可以用递归法或迭代法。
Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place.
You can think of the left and right pointers as synonymous to the predecessor and successor pointers in a doubly-linked list. 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.
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. You should return the pointer to the smallest element of the linked list.
Example 1:
Input: root = [4,2,5,1,3]
最低0.47元/天 解锁文章
1234
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
