Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
pp:2023:haskell:l08_2 [2023/04/27 13:57] george.vanuta |
pp:2023:haskell:l08_2 [2023/04/27 14:16] (current) george.vanuta |
||
|---|---|---|---|
| Line 124: | Line 124: | ||
| </code> | </code> | ||
| - | **8.3.2.** In order to view an **infinite tree**, we need to convert it to a finite **binary tree**. Define the ''sliceTree'', which takes a level ''k'', an **infinite tree** and returns the first ''k'' levels of our tree, in the form of a finite one. | + | **8.3.2.** In order to view an **infinite tree**, we need to convert it to a finite **binary tree**. Define the function ''sliceTree'', which takes a level ''k'', an **infinite tree** and returns the first ''k'' levels of our tree, in the form of a finite one. |
| <code haskell> | <code haskell> | ||