1. Given a binary tree, write a Java program that determines if the binary tree is balanced.

2. Given a binary tree and a value x, check the given tree has paths that its value is equal to the given value x. The path value is calculated from the values of nodes of the given tree by traversing the tree from root to leaf. If there are paths, write the node positions from root to leaf.

I.e: Given the binary tree in Figure 1 and the sum 22, the result should be true

input format:5 4 8 11 - 13 4 7 2 - - - - - 1

output format:You must write your solution to output file which its name given in program argument list. In first exercise, true or false. In second exercise; according to given example; T[0]+T[1]+T[3]+T[8]=22

5 / 13 11 72 1