We learned how to traverse a tree in different ways(inorder, preorder, postorder, BFS, DFS), now we want to invent a new traversal method and call it MyOrder. In MyOrder nodes are visited in the following manner: 2,7 1,5 3, 8 2 8 Write a java method that receives a reference to a binary tree node and prints the values of nodes according to MyOrder traveral