1. Write a program that finds in a binary tree of numbers the sum of the vertices of each level of the tree.
2. Write a program that finds and prints all vertices of a binary tree, which have for only leaves successors.
3. Write a program that checks whether a binary tree is perfectly balanced.