Question

What are search tries? Why are they more efficient than usualsearching algorithms?

Answer 1

Answer:

Trie is a tree based data structure where the keys are strings.  

Search trees are a data structures in Computer Science in which they are based on trees.

Explanation:

Search trees are tree based data structures which are used to search elements in the tree as the names suggests (search tree). However, for a tree to perform as search tree the key it has to follow specific conditions. They are , the the key of any node has to be less than the all the keys present in the right sub trees and greater than all the keys present in the left subtree.