Introduction
The very basics
Infinite looping
Processing trees with recursive CTEs
Processing graphs with recursive ctes
Summary

Instruction

Very well done! We'll now see a very common mistake made with recursive CTEs. What is the error? Let's see it in an exercise.

Exercise

Let's try something similar to the previous exercise. This time, we want to show all the possible words that are created with letters a and b and are not longer than 5 letters.

Try to run the query. What do you think will happen?

After you run the query, click I'm done. Next exercise.