Tree datastructures: Difference between revisions
m
→{{header|Haskell}}: Tidied one function.
(Add nest task "hint" and notes) |
m (→{{header|Haskell}}: Tidied one function.) |
||
Line 552:
import Data.Aeson
import Data.Aeson.Text
import Control.Arrow ((***))
-- TREES <-> LIST OF LEVELS <-> TREES -----------------------
Line 566 ⟶ 567:
let go [] = []
go ((n, s):xs) =
in go pairs
| |||