In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs.
An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to a theoretically infinite size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.
Sometimes the term "inductive data type" is used for algebraic data types which are not necessarily recursive.
Famous quotes containing the words data and/or type:
“To write it, it took three months; to conceive it three minutes; to collect the data in it—all my life.”
—F. Scott Fitzgerald (1896–1940)
“Lise: Look, monsieur, I don’t know what type of girl you think I am, but I’m not. And now I would like to return to my friends.
Jerry: I thought you were bored with them. You sure looked it.
Lise: You should see me now.
Jerry: Ouch.”
—Alan Jay Lerner (1918–1986)