Pros
- BST supports traversal of all or part of tree (in contrast to hash table)
- BST supports searching for a range of search keys (in contrast to hash table)
- If fast searching and traversal capabilities are needed, then a BST is a good choice
- A BST supports duplicate keys while a hash table does not
Cons
- A hash table has a faster search efficiency of O(1) -- BST efficiency is O(log N) if balanced
- If only fast searching is needed, then a hash table is a better choice than a BST
- A BST needs to be balanced to achieve search efficiency of O(log N) -- otherwise it can degrade back to O(n)