What would we call this datastructure?
A tree is not restricted to a certain branching factor. A n-ary tree may only have a branching factor of n (or less), but in an unrestricted tree, each node may contain an arbitrary number of subnodes. 

A tree is a connected graph without cycles, so your datastructure still satisfies that definition. 

Alternatively you could call your structure something like "nested lists".