Trie or Prefix Tree

Let’s consider another popular data structure: Trie or Prefix tree.

Binary search tree

Binary search tree (BST) is a data structure that allows fast element lookup, addition or removal of items.