SHOW:
|
|
- or go back to the newest paste.
| 1 | datatype bstree = | |
| 2 | br of bstree * int * bstree | |
| 3 | | lf | |
| 4 | ||
| 5 | ||
| 6 | val tree = br (br (br (lf, 2, lf), 7, lf), 9, br (br (lf, 13, lf), 21, br (lf, 25, lf))); | |
| 7 | ||
| 8 | (*fun toList(tree: bstree): int list (vrne seznam urejenih elementov podanega drevesa, | |
| 9 | v seznamu naj bo prvi element min(tree), zadnji pa max(tree) | |
| 10 | · za združevanje seznamov lahko uporabite operator @) *) | |
| 11 | ||
| 12 | fun toList(tree: bstree): int list = | |
| 13 | case tree of | |
| 14 | br(left, i, right) => toList(left) @ [i] @ [] @ toList(right) | |
| 15 | | lf => [] | |
| 16 | ||
| 17 | - | fun(tree) |
| 17 | + | toList(tree) |
