title: Which is faster, a ternary search tree or a binary search tree?
body: <p>ternery search tree requires O(log(n)+k) comparisons where n is number of strings and k is the length of the string to be searched and binary search tree requires log(n) comparisons then why is TST faster than BST ?</p>