Summary: First name ast name atri ati n n m er
1
Exercise 1 (2+2+2 points)
e in ata str t re re resents inar trees n ntainin a es in t e inner n es
data Tree a = Leaf | Node (Tree a) a (Tree a)
nsi er t e tree t inte ers n t e ri t an
si e e re resentati n t as an e t t e
Tree Int in as e e
Node (Node Leaf 2 Leaf) 1 Leaf
#
#
#
#
#
#
#
#
# # # # # # #
#
#

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

Collections: Computer Technologies and Information Sciences