A free tree is never rooted
Infinite complete binary tree
A finger tree has internal nodes
Each one in this tree has child nodes
And their connection is a walk
Parents and children walking the tree
Nodes without children are called leaves
While roots are leaves of the finger trees
An intelligent word tree
Trees-no one-to-one correspondence
Adaptive merging operation
Implement of finger-searching trees.
Poem by Marieta Maglas
This poem has not been translated into any other language yet.
I would like to translate this poem