USING JAVA, Given a binary tree, write an efficient algorithm to print all paths from the root node to every leaf node in it.

(Example output):

1-->2-->4

1-->2-->5

etc.

2 4 4 6 7 8