Hello I need this in java it is from exercise 6.7 in the text book Open Data Structures

Create a subclass of BinaryTree whose nodes have fields for storing preorder, post-order, and in-order numbers.

Write methods

preOrderNumber(),

inOrderNumber(),

and postOrderNumbers()

that assign these numbers correctly.

These methods should each run in O(n) time.