Mirror trees

Write a program that reads various binary trees of natural numbers and,
for each one, indicates if is a mirror tree or not. We say that a tree
is mirror if its left side and its right side are the one like the
reflection of the other in a vertical mirror.

Input

Input is a sequence of descriptions of trees as it is explained at the
exercise REREC.

Output

For each tree, your program must print "MIRROR" or "NO MIRROR" as
required.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T10:33:27.974Z

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