Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
Describe (in pseudo-code) a findAll Elements ( k ) method of an AVL tree T . It should run in O (logn + s ) time where n is the size of T and s is...
1. a. Describe (in pseudo-code) a findAll Elements (k) method of an AVL tree T. It should run in O(logn + s) time where n is the size of T and s is the number of elements returned (i.e., the number of nodes in T whose key is k).
b. Analyze the running time of your algorithm.
