I have spent a lot of time in the source and it seems like every time there is a “Tree” structure (BehaviorTree, SkeletonTree, etc.) they are concrete implementations of a “tree” with it’s own specific logic.
I am a bit curious, is there a template/generic declaration file that I am missing that defines an N-Ary Tree? If not, is there a data structure or set of generic algorithms that can treat something, say a TArray, as a Tree?