I think you might want to consider a hash of hash data structure. In that way, you can have a finer control of your data and you can do whatever you like for the missing data as well.
can you please allow me to know the details logic of hash of hash data structure and also finder control.
I think Hash Datastructure traverse the data from leaf to root of a tree. How can I configure the data in C.
In C I can do link list of structures. then it will be very easy to find the data.
Can you please help me here?