Expression Trees
R. J. Mitchell · 1991
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.