lama_byterun/regression/x86only/test001.expr
2019-11-24 02:30:32 +03:00

21 lines
453 B
Text

external fun printf ();
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
}
local i, 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)