Abstract
Binary trees were introduced in the last chapter as a means of storing data in a structure which can be searched rapidly. Another use of trees is for storing arithmetic expressions, and this is the topic of this chapter. Tree structures again provide elegant data representation and their processing is achieved by elegant and recursive procedures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Neill Graham Introduction to Computer Science West 1982
J.S. Rohl Recursion via Pascal Cambridge University Press 1984
Author information
Authors and Affiliations
Copyright information
© 1991 R. J. Mitchell
About this chapter
Cite this chapter
Mitchell, R.J. (1991). Expression Trees. In: Modula-2 Applied. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12439-8_18
Download citation
DOI: https://doi.org/10.1007/978-1-349-12439-8_18
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-55453-1
Online ISBN: 978-1-349-12439-8
eBook Packages: EngineeringEngineering (R0)