Search and insert operations in BST require a time proportional to log(N) on average. Since with BST the shape of the tree depends on the order in which the nodes are added to the BST, in the worst case the tree that results from an insertion of N key-value pairs in a BST can be...