So far, I've chalked out the following:
1.Definition (with the factorial or euclid's algorithm example)
2.Self referential structures.
3.Show intuitively that recursion is equivalent to iteration.
4.General approach of Divide and Conquer algorithms.
5.Show how the stack is used in recursion.
6.Performance, tail recursion..etc.
Which among the above do you think should be left out, given the time constrain?
Anything important I missed?