How long can you complete? Can you inform me? Can you write a comment.

Please make sure the code you wrote is correct, Thank you.

Please don't make the code structure complicated.

your code structure will be suitable for object oriented programming.

can you explain the code you wrote (create comment lines. (explain methods)

java programming OOP binary tree 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 the image and the sum 22, the result should be "true" 1 Input format: Your program must accept the input data, from file which its name given in program argument list, plotted as a binary tree in [Figure a], as the following format: 5 4 8 11 - 13 4 7 2 - - - - - 1 hyphen refers to no node. There is one space between each value. Program Output: T[0]+T[1] +T[3] +T[8] =22