I noticed that every fundamental data structure in Computer Science seems recursive in nature. e.g. Graphs, Lists, Arrays, Sets, etc.
Why is that? Is there some fundamental reason? Is it because it's easier to prove the properties of recursive data structures via induction?