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 unbalanced and look like a chain of left links so that accessing a node can require ...