Hello, im currently making a program that i want to store values in specifik way and im not sure of the best way and I hoped for some advice.
I need to store it so that it resembles a family tree with each element having 2 parents.
[x] [x] [x] [x]
it will consist of 10 rows of strings ranging from one element to the last with 512 elements. (1,2,4,8,16,32,64,128,256,512).
*need to be able to replace an element at a certain index.
*The values inserted must also be in the order they were put in.
*an "easy" way to find the parents of the child.
As for now i have made this in 10 arrays x2 (but the coding was a bit extensive about 900 lines so im hoping to reduce that somewhat