For a rooted tree with any arbitary number of children for each node, not necessarily n-ary tree. \nRemove all the leaf nodes, and store them in a list, this would create new leaf nodes. Repeat untill all the nodes are removed\nConditions : Freshly created leaf nodes(node whose children are removed) should not be removed just after its children are removed, unless there\'s no other option for us, then we can remove it\n\nFor Example\n\t\t\t\t\t\n\t\t\t\n                                 1\n\t\t\t\t\t\t2        3       4\t\t\n\t\t\t\t\t5  6  8     7\n\t\t\t\tFollowing is a tree rooted at 1, with 2,3,4 as its children. 2 has children 5,6,8 and 3 has children 7\t\n\t\t\t\t\n\t\t\tOne Possible output for the given input would be,\n\t\t\t5 6 8 7 4 2 3 1\n\t\tExplanation : Remove 5 & 6 since they are leaf nodes, Now 2 is a freshly created leaf\n\t\tSince we can process other nodes, we will not remove it\n\t\tNext Leaf removed is 7, After this newly created 3 cannot be removed\n\t\tHence Remove 4, after that since it is a leaf\n\t\tNow Remove 2, after which remove 3\n\t    1 is now a freshly created leaf, but since there is no other options remaining, remove 1\n\t\t

For a rooted tree with any arbitary number of children for each node, not necessarily n-ary tree. \nRemove all the leaf nodes, and store them in a list, this wo