Abstract
We may say “recursive” as an abbreviation for “recursively defined”: recursive grammar, recursive data structure, recursive routine. But this is only a convention, because we cannot say that a concept or a structure is by itself recursive: all we know is that we can describe it recursively, according to the above definition. Any particular notion — even the infinite Laughing Cow structure — may have both recursive and non-recursive definitions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meyer, B. (2013). Recursion and trees. In: Touch of Class. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92145-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-92145-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92144-8
Online ISBN: 978-3-540-92145-5
eBook Packages: Computer ScienceComputer Science (R0)