Blatt 6 (optional)

Assignments: 3

Binary Tree Type: Given the recursive algebraic data type data Tree a = Leaf a | Node (Tree a) (Tree a) deriving Show The 'deriving Show' part makes sure that a Tree can be printed. Note...
Lists as Monads: By now, you should have an impression of the Maybe monad introduced in the lecture. This is by far not the only monad in Haskell, in fact you are already familiar with another important monad:...
Moving in 3 dimensions: Imagine a grid of voxels in three-dimensional space. Each voxel is uniquely identified by its coordinates (x, y, z) where x, y, z are integers. You start somewhere on the grid and move according...