Left child, right sibling (3)

Write a program that reads a general tree of words, and prints its
corresponding binary tree following the format of the exercise ESCAR.

Input

Input consists of the description of a tree of words as is explained at
the exercise REREG. All the words have less than ten letters.

Output

Your program must print the binary tree corresponding to the general
tree following the format of the exercise ESCAR.

From the general tree, the associated binary tree can be written
directly. Therefore, is not necessary to construct it explicitly.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T10:21:46.064Z

© Jutge.org, 2006–2026.
https://jutge.org
