mirror of
https://github.com/ProgramSnail/Lama.git
synced 2025-12-07 23:38:47 +00:00
20 lines
449 B
Text
20 lines
449 B
Text
|
fun insert (tree, value) {
|
||
|
|
case tree of
|
||
|
|
`Empty -> return `Node (value, `Empty, `Empty)
|
||
|
|
| `Node (x, left, right) ->
|
||
|
|
if x > value
|
||
|
|
then return `Node (x, insert (left, value), right)
|
||
|
|
else return `Node (x, left, insert (right, value))
|
||
|
|
fi
|
||
|
|
esac
|
||
|
|
}
|
||
|
|
|
||
|
|
tree := `Empty;
|
||
|
|
|
||
|
|
for i := 0, i <= 10, i := i+1 do
|
||
|
|
printf ("%s\n", tree.string);
|
||
|
|
tree := insert (tree, i)
|
||
|
|
od;
|
||
|
|
|
||
|
|
printf ("%s\n", tree.string)
|