October, Week 5

This week we have been introduced to structural induction, which is a useful tool to deal with data structures such as trees. Structural induction uses the fact that from the definition of a simplest element we can go on to more complex elements. That is, simplest elements serve as bulding blocks for more complex data structures. In case of a tree, it is enough to define a node and how a new tree is constructed.