What would you consider to be a consolidated diagram of related data structures order by the most simple ones?

I don't mean organize Data Structures by ther complexity learning them but the other DS they extend from. For example:

• I think it is far to say that a Binary Tree is a extended Tree which happens to have a constrain (0,1 or 2 direct children only);
• A Graph is a extended Linked List (I would think, tell me if you disagree);
• etc

I guess my question is, how would you consider to be an unified diagram with the DS you know? Would that result be a matter of opinion or there is formal information about the matter?

Thanks