Please I want a solution using Java and adhere to what is required and want it as soon as possible

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: Write a java method that recelves a reference to a binary tree node and prints the values of nodes according to MyOrder traveral