Feel free to remove the definitions page at the back of the exam, as you'll be using it for questions 3, 4, and 5.
| Question | Mark |
| 1. Recursive tree functions [5 marks] | |
| 2. Non-recursive tree functions [5 marks] | |
| 3. Implementing private methods [5 marks] | |
| 4. Implementing public methods [5 marks] | |
| 5. Using a tree class [5 marks] | |
| 6. Inheritance and dynamic binding [5 marks] | |
| Exam Total [30 marks] |