1. Design a class of nodes that you can use in the implementation of a 2-4 tree. Is one class enough, or will you need several? 2. Exercise 13 asked you to revise the search algorithm for a 2-3 tree,...

1. Design a class of nodes that you can use in the implementation of a 2-4 tree. Is one class enough, or will you need several?

2. Exercise 13 asked you to revise the search algorithm for a 2-3 tree, as given in Segment 28.14. Implement your revised pseudocode.

3. Implement a class of 2-4 trees in which only additions and retrievals are permitted.

4. Implement a class of red-black trees that permit only additions and retrievals.