Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of String but also build up problem-solving skills.
In this problem, we are given, a Binary Tree of N edges. The task is to convert this to a Circular Doubly Linked List (CDLL) in-place. The left and right pointers in nodes are to be used as previous and next pointers respectively in CDLL. The order of nodes in CDLL 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 CDLL.
Input:
1
/ \
3 2
Output:
3 1 2
2 1 3
After converting tree to CDLL when CDLL is is traversed from head to tail and then tail to head, elements are displayed as in the output.
Give the problem a try before going through the video. All the best!!!
Problem Link:
Solution Link:
