COMP225 Practical Exercises for Week 4

  1. Implement Tree sort from the desciption given in lectures and experiement on some small examples.
  2. * Using the QuestionNode class released as part of assignment 1, write a function which takes a binary tree (of type QuestionNode*) and a sequence of "yes/no" responses and traverses the tree following the responses, printing out the text at each node. If a leaf node is reached before the end of the list of responses, then your program should terminate safely.

    All enquiries to Annabelle McIver