Trying to figure out the best way to represent data when you have a taxonomy of nodes that have an unknown depth of child nodes.
Think of a tree with a trunk → branch → leaf
Only it might be: Trunk → big branch → smaller branch → stick → leaf.
The only way I know how to represent a nested taxonomy of unknown depth is via using ParentID as a field to relate back to whatever node is the parent, and do that all the way back to the root node. As best I can tell Adalo does not support recursion within a collection like this however.
Has anyone developed a workaround in absence of this? Would Adalo consider adding the capability to do ParentID fields?