mirror of
https://github.com/ProgramSnail/Lama.git
synced 2025-12-06 06:48:48 +00:00
32 lines
671 B
Text
32 lines
671 B
Text
local n, t;
|
|
|
|
fun insert (t, x) {
|
|
case t of
|
|
Leaf -> return Node (x, Leaf, Leaf)
|
|
| Node (y, l, r) -> if x > y
|
|
then return Node (y, insert (l, x), r)
|
|
else return Node (y, l, insert (r, x))
|
|
fi
|
|
esac
|
|
}
|
|
|
|
fun find (t, x) {
|
|
case t of
|
|
Leaf -> return 0
|
|
| Node (y, l, r) -> if x == y then return 1
|
|
elif x > y then return find (l, x)
|
|
else return find (r, x)
|
|
fi
|
|
esac
|
|
}
|
|
|
|
n := read ();
|
|
|
|
t := insert (insert (insert (insert (Leaf, 5), 4), 6), 3);
|
|
|
|
write (find (t, 5));
|
|
write (find (t, 4));
|
|
write (find (t, 6));
|
|
write (find (t, 3));
|
|
write (find (t, 2));
|
|
write (find (t, 1))
|