37 lines
4 KiB
Haskell
37 lines
4 KiB
Haskell
[ Node { rootLabel = 473
|
|
, subForest = [ Node { rootLabel = 38
|
|
, subForest = []
|
|
}
|
|
, Node { rootLabel = 406
|
|
, subForest = [ Node { rootLabel = 498
|
|
, subForest = [ Node { rootLabel = 97
|
|
, subForest = [ Node { rootLabel = 262
|
|
, subForest = [ Node { rootLabel = 310
|
|
, subForest = []
|
|
},
|
|
Node { rootLabel = 400
|
|
, subForest = [ Node { rootLabel = 115
|
|
, subForest = []
|
|
},
|
|
Node { rootLabel = 568
|
|
, subForest = []
|
|
},
|
|
Node { rootLabel = 544
|
|
, subForest = []
|
|
},
|
|
Node { rootLabel = 133
|
|
, subForest = []
|
|
}
|
|
]
|
|
}
|
|
]
|
|
}
|
|
, Node { rootLabel = 505
|
|
, subForest = []
|
|
}
|
|
, Node { rootLabel = 521
|
|
, subForest = []
|
|
}
|
|
]
|
|
}
|
|
, Node { rootLabel = 34, subForest = [Node {rootLabel = 118, subForest = [Node {rootLabel = 240, subForest = [Node {rootLabel = 93, subForest = []}]}]}]}]}]},Node {rootLabel = 27, subForest = []},Node {rootLabel = 526, subForest = [Node {rootLabel = 243, subForest = []},Node {rootLabel = 307, subForest = []}]}]}]
|