Lab questions

Solving these questions is optional. However I believe that they are a real support to the understanding of the language, and they are also a good preparation for the last assignment.

1. Transform the implementation of trees provided in the previous section into a generic implementation.
2. Provide a forward iterator for the search trees you developped in your answer to the previous question. Can you provide a bidirectional iterator? How about a random iterator?