Q:

Create binary tree from tree (n-ary)

I  want to solve the problem given in the image below.

A:

A New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree.
Refer This Paper
In Simple words:
1. Create L to R sibling pointers at each level 
2. Remove all but the leftmost child pointer of each node 
3. Make the sibling pointer the right pointer.

