Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics

© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022

R. WienerGeneric Data Structures and Algorithms in Gohttps://doi.org/10.1007/978-1-4842-8191-8_13

13. Expression Trees

Richard Wiener¹  

(1)

Colorado Springs, CO, USA

 

In the previous chapter, we presented red-black trees. These binary search trees provide faster insertion performance compared to AVL trees but slower search time.

In this chapter, we introduce and implement expression trees. These are used to represent and evaluate some mathematical expressions.

In the next section, we introduce expression trees.

13.1 Expression Trees

Expression trees are used to represent and evaluate mathematical expressions. Here, we limit such expressions to have operands given ...