Given a Binary Tree of size N, extract all its leaf nodes to form a Doubly Link List strating from the left most leaf. Modify the original tree to make the DLL thus removing the leaf nodes from the tree. Consider the left and right pointers of the tree to be the previous and next pointer of the DLL respectively.
Input : 1 / \ 2 3 / \ / \ 4 5 6 7 Output: Modified Tree : 1 / \ 2 3 Doubly Link List : 4 <-> 5 <-> 6 <-> 7 Explanation: The leaf nodes are modified to form the DLL in-place. Thus their links are removed from the tree.
Input : 1 / \ 2 3 / \ 4 5 Output: Modified Tree : 1 / 2 Doubly Link List : 4 <-> 5 <-> 3
You dont need to read input or print anything. Complete the function convertToDLL() which takes root of the given tree as input parameter and returns the head of the doubly link list.
The generated output will contain the inorder traversal of the modified tree, the DLL from left to right and the DLL from right to left.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(height of tree)
1 ≤ N ≤ 10^4
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes