Maximize sum of path from the Root to a Leaf node in N-ary Tree

// Java code to find the maximum sum of a path from 
// the Root to a Leaf node in an N-ary Tree

import java.util.ArrayList;

class Node {
    int data;
    ArrayList<Node> child;

    Node(int x) {
        data = x;
        child = new ArrayList<>();
    }
}

class GfG {
  
    // Recursive function to calculate the
    // maximum sum in a path using DFS
    static void DFS(Node root, int sum, int[] ans) {
      
        // If the current node is a leaf node
        if (root.child.size() == 0) {
            ans[0] = Math.max(ans[0], sum);
            return;
        }

        // Traversing all children of
        // the current node
        for (int i = 0; i < root.child.size(); i++) {
          
            // Recursive call for all
            // the children nodes
            DFS(root.child.get(i), sum + root.child.get(i).data, ans);
        }
    }

    public static void main(String[] args) {
  
        Node root = new Node(1);
        root.child.add(new Node(2));
        root.child.add(new Node(3));
        root.child.get(0).child.add(new Node(4));
        root.child.get(1).child.add(new Node(6));
        root.child.get(0).child.add(new Node(5));
        root.child.get(1).child.add(new Node(7));
        root.child.get(1).child.add(new Node(8));

        int[] maxSumPath = new int[1];
        maxSumPath[0] = 0;
        DFS(root, root.data, maxSumPath);

        System.out.println(maxSumPath[0]);
    }
}