Summary: First name Last name Matriculation number
1
Exercise 1 (2+2+2 points)
The following data structure represents binary trees only containing values in the inner nodes:
data Tree a = Leaf | Node (Tree a) a (Tree a)
Consider the tree t of integers on the right­hand
side. The representation of t as an object of type
Tree Int in Haskell would be:
Node (Node Leaf 2 Leaf) 1 Leaf
1
#
#
#
#
#
#
#
#
# # # # # # #
2

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences