1. Two binary trees are called "like looking in the mirror" if both are empty or not, if the left side on the first tree is similar to the right side of the second tree. The following figure shows this situation. Develop a Java program that checks whether two binary trees are "like looking in the mirror
2. A binary tree whose nodes contain unilateral beginnings of linked lists. Write a program in Java that creates such a structure, fills it with data and prints total number of elements of such a structure (number of nodes in the tree and the number of elements of all lists).
Atach for pictures