Given A binary Tree, Task is to remove all the half nodes (which has only one child).
For example consider the below tree.
Nodes 7, 5 and 9 are half nodes as one of their child is Null. We need to remove all such half nodes and return the root pointer of following new tree.
First line of input contains the number of test cases T. For each test case, there will be two lines:
1. First line of each test case will be an integer N denoting the number of parent child relationships.
2. Second line of each test case will print the level order traversal of the tree in the form of N space separated triplets. The description of triplets is as follows:
Please note that the relationships are printed only for internal nodes and not for leaf nodes.
Single line output, print the modified tree in inorder traversal.
You don't have to take input , just complete the function removeHalfNodes() which accepts root node of the tree as parameter and returns the root node of new tree (after removing half nodes).
7 7 L 7 8 R 7 2 L 7 -1 N
2 7 8
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.