Скачать
06-05 Recap: Labelling Trees (Introduction to Haskell)
Автор: Well-Typed
Загружено: 2024-07-05
Просмотров: 371
Описание:
As another and entirely independent example, we consider a task from Assignments B, that of labelling all the nodes in a binary tree with unique labels. As a preparation, we first solve this task in classic pattern-matching style. We need to introduce an auxiliary function that has an extra integer as an input (representing the label from which we want to start labelling the current tree), and an extra integer as an output (representing the label that is the first label free to use after we are done with labelling the current tree).
Course site with self-test questions: https://teaching.well-typed.com/intro...
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
