The number of nodes in such a tree is less than twice the number of strings: for each string that is inserted into the tree, at most one new node is added and at most one existing node is split into two nodes.
The number of nodes in such a tree is less than twice the number of strings. For each string, at most one new node is added and at most one existing node is split into two nodes.