On Thu, Mar 25, 2021 at 10:40:21AM +0100, Alexander Burger wrote: > 3. The tree is automatically balanced, independent of the insertion order.
This is only true if there are no final gaps in the keys.
What we can say, however, is that every item is placed at a depth which is the
2-logarithm of its key.
: (enum 'E 64 "Test")
-> "Test"
: E
-> (NIL (NIL (NIL (NIL (NIL (NIL ("Test")))))))
☺/ A!ex
--
UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
