Write code using java for a recursive [pre-order | post-order | in-order] tree traversal of a binary tree that prints the nodes values out. Assume a generic Node class with a data field and an array of node children