Remove Leaf Nodes from a Tree

In this problem, you are tasked to remove all the leaf nodes from a given generic tree. A leaf node is defined as a node that does not have any children.

Note:

The root itself can be considered a leaf node if it has no children. There is no need to print the tree. After removing all the leaf nodes, return the updated root of the tree.

Input:

Line 1: Elements in level order form separated by space. The format is: 
Root_data, n (No_Of_Child_Of_Root), n children, and so on for every element.

Output:

Elements printed level-wise, with each level on a new line and separated by space.

Constraints:

• The tree can be empty, meaning there are no nodes to process.
• Each node description in the input includes the node's data followed by the number of its children.
• A valid input will represent a valid tree structure in the described format.