Given the following 234 TreeNode. How to implement the inOrder Traversal for this 234 Tree?

public class Tree24Node> { public ArrayList elements = new ArrayList(3); public ArrayList> child = new ArrayList>(4); public Tree24Node() { } public Tree24Node(E e) { elements.add(e); } }