Convert Binary Search Tree To Doubly Linked List
medium
1. Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place. 2. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL. 3. The order of nodes in DLL must be the same as in Inorder for the given Binary Search Tree. The first node of Inorder traversal (leftmost node in BST) must be the head node of the DLL.
Constraints
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Format
Input
Input is managed for you.
Output
Output is managed for you.
Example
Sample Input
7
1 2 3 4 5 6 7
Sample Output
1 2 3 4 5 6 7