Question

a) A team of biologists keeps information about DNA structures in an AVL tree using as key the specific weight (an integer) of a structure. The biologists routinely ask questions of the type: “Are there any structures in the tree with specific weights between a and b (both inclusive)”, and they hope to get an answer as soon as possible. Design an efficient algorithm that given integers a and b returns true if there is a key x in the tree such that a ≤ x ≤ b, and returns false if no such key exits. Describe your algorithm in pseudo-code.
b) What (and why) is the time complexity of the algorithm?

Answer 1