Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be same as Inorder of the given Binary Tree. The first node of Inorder traversal (left most node in BT) must be head node of the DLL.
The task is to complete the method which takes two arguments, root of Binary Tree and reference to head of DLL.
The struct Node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.
The function should change reference of head to head of linked list.
1 <=T<= 30
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
1 2 R 1 3 L
10 20 L 10 30 R 20 40 L 20 60 R
3 1 2 2 1 3 40 20 60 10 30 30 10 60 20 40
There are two test casess. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 2 and right child of 1 is 3. Second test case represents a tree with 4 edges and 5 nodes.
The output of complete program is forward and backword traversals of modified linked list.