Tree

A tree is a widely-used data structure that emulates a hierarchical tree-like structure with a set of linked nodes.

Trie

A tree-like data structure used to hold an associative array, also called a Prefix Tree.

Better kind thing

Quality | Example |
---|---|

Better |
"A trie is better than a binary search tree for searching elements" from question "Data structure for storing array of strings in a memory" "A trie is better suited to this kind of thing because it lets you store your symbols as a tree and quickly parse it to match values or reject them" from question "Hash a byte string" |

Better binary |
"The article says that a trie is better than binary tree as for a string of length m for trie it takes o m time and for binary tree it takes o m logn time" from question "Storing keys in binary search tree" |

More similar |
"Recursive is usually used for traversal and binary search tree but this tree is more similar to trie of only 2 character in alphabet" from question "Recursion Filling a Tree" |

Suffix advanced substrings

Quality | Example |
---|---|

Less |
"A suffix tree has less dummy nodes than the suffix trie" from question "Suffix tree and Tries. What is the difference?" |

More |
"A suffix tree is more or less an advanced trie here you can also search for any substrings in o c as for the trie" from question "Typeahead / Incremental Search in java" |

Efficient ternary sort

Quality | Example |
---|---|

Substantially more |
"For cases where each node in the trie has most of its children used the trie is substantially more space efficient and time efficient than th ternary search tree" from question "Tries versus ternary search trees for autocomplete?" |

More |
"Most likely a trie is more efficient and you didn t sort your dictionary and it doesn t use a binary tree or ternary tree" from question "PHP - Most Efficient Dictionary Code" |

Others