How would you implement a child-parent relation for finding the Least Common Ancestor (LCA) without using pointers?

To implement a parent-child relationship for LCA without pointers, we can represent the tree structure using an array or a similar data structure. Each element in the array can store the index of its parent. For instance, parent[i] would hold the index of the parent of node i. This array effectively simulates the parent pointers. Once this representation is established, the standard LCA algorithms can be adapted to work with array indices instead of direct memory addresses or pointers.