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.

**Input:**

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:

- Each triplet will contain
**three space-separated**elements of the form (int, int char). - The first integer element will be the value of
**parent**. - The second integer will be the value of corresponding
**left**or**right**child. In case the child is null, this value will be**-1**. - The third element of triplet which is a character can take any of the three values ‘
**L**’, ‘**R**’ or ‘**N**’. L denotes that the children is a left child, R denotes that the children is a Right Child and N denotes that the child is NULL.

Please **note** that the relationships are printed only for internal nodes and not for leaf nodes.

**Output:**

Single line output, print the modified tree in inorder traversal.

**Your Task:**

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).

**Constraints:**

1<=T<=100

1<=N<=100

**Example:
Input:**

1

4

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.

Author: saksham seth

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.

tushki | 198 |

namansharmacse17 | 110 |

TusharMittal3 | 70 |

adkeaesph | 57 |

deepakchoudhary11 | 48 |

ARUN_PUNDIR | 720 |

manishgupta8497 | 623 |

AMAN__JAIN | 596 |

Abhimanyu_kumar | 562 |

Bicky_Shokeen | 532 |

blackshadows | 5335 |

Ibrahim Nash | 5223 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4584 |

Login to report an issue on this page.