Given the following 234 TreeNode. How to implement the inOrder Traversal method in JAVA for this 234 Tree, according to this code?

import java.util.ArrayList; public class Tree24> { Tree24Node root = null; void inOrder(Tree24Node node) { //Enter code here } public static void main(String[] args) { Tree24 tree = new Tree24(); tree.root = new Tree24Node(1); //Some more insert... tree.inOrder(tree.root); //Make this method work! } } class Tree24Node { public ArrayList elements = new ArrayList<>(3); public ArrayList child = new ArrayList<>(4); public Tree24Node() { } public Tree24Node(E e) { elements.add(e); } }