How to write a code in C to find the best sum in any tree path without using structures

Question

I\'m supposed to write a function that finds the largest sum on any non-empty path in the tree without structures. The parameters are an int parent array where parent[i] = j