1 Discuss the trade-offs between the array-based implementation of a sorted list presented in Chapter 16 and a binary search tree implementation of a sorted list. 2 As mentioned earlier, expression...

1 Discuss the trade-offs between the array-based implementation of a sorted list presented in Chapter 16 and a binary search tree implementation of a sorted list.

2 As mentioned earlier, expression trees are binary trees that contain the operands and operators of expressions. Because an expression tree is never empty, it lends itself to a particularly elegant kind of recursive processing. In this section, we design and implement an expression tree to support the processing of arithmetic expressions