Suffix links are a key feature for older linear-time construction algorithms, although most newer algorithms, which are based on Farach's algorithm, dispense with suffix links. In a complete suffix tree, all internal non-root nodes have a suffix link to another internal node. If the path from the root to a node spells the string formula_18, where formula_19 is a single character and formula_20 is a string (possibly empty), it has a suffix link to the internal node representing formula_20. See for example the suffix link from the node for codice_2 to the node for codice_3 in the figure above. Suffix links are also used in some algorithms running on the tree.