Tree Efficiency
	• With a binary search tree, – the actual performance of Retrieve, Insert, and Delete actually depends on the tree's height. Why? – Because we must follow a path from the root of the tree down to the node that contains the desired item. – At each node along the path, we must compare the key to the value in the node to determine which branch to follow.