Complex sentence: Such a compressed ternary search tree has "O" ("n") nodes--for each string inserted there is at most one new node added and one existing node split into two nodes.
Split into simpler sentences: Such a compressed ternary search tree has "O" ("n") nodes. For each string inserted, there is at most one new node added and one existing node split into two nodes.