Binary Search Tree

  • Complexity
    • A well-balanced BST will need time proportional to M * log N,
      • M is maximum string length and
      • N is a number of keys in the tree.