Diferente pentru trie-forest-based-sort intre reviziile #16 si #17

Nu exista diferente intre titluri.

Diferente intre continut:

h3. 1) if there is a trie with height h in the binary search tree, we insert the string in that trie
h3. 2) if there isn't a trie with height h in the binary search tree, we create it, we insert the string in that trie, and then we insert the trie in
h3. 2) if there isn't a trie with height h in the binary search tree, we create it, we insert the string in an empty trie, and then we insert the trie in
h3. the binary search tree.

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.