(Node root)
| 3 | class Solution { |
| 4 | // Function to return a list containing the inorder traversal of the tree. |
| 5 | ArrayList<Integer> inOrder(Node root) { |
| 6 | |
| 7 | //New ArrayList to return |
| 8 | ArrayList<Integer> li = new ArrayList<Integer>(); |
| 9 | |
| 10 | travel(root, li); |
| 11 | |
| 12 | return li; |
| 13 | } |
| 14 | |
| 15 | public static void travel(Node root, ArrayList<Integer> ans) |
| 16 | { |