IN JAVA ONLY:

Implement InOrderWalk algorithm. Your function must take an ArrayList as input and produce another ArrayList as output where the elements are arranged according to the in-order. Figure 1: A binary tree 100 50 40 200 30 60 The binary tree from above will be represented as 1003, 150, 200), {40,200, null, null), 130, 60, null, null, null, null, null, null)) Please, read input from the text file input.txt. For the example above, the contents of the file should look like 100 50,200 40,200.null.null 30,60.null.null.null,null.null.null Output the nodes in-order to the standard output (screen). So, your function should look something like: void InOrderWalk(ArrayList