Recall that search time is O(h), where h is the height of the tree. Definition of height int compute_height(Node n) { if (n == null) { return -1; } else { int hl ...