In such a compressed ternary search tree, the number of nodes is less than twice the number of strings--for each string there is at most one new node added and one existing node split into two nodes.
In such a compressed ternary search tree, the number of nodes is always less than twice the number of strings. For each string that is inserted into the tree there is at most one new node added and one existing node split into two nodes.