Describe a simple modification to the BST that will allow it to easily support finding the Kth

Question:

Describe a simple modification to the BST that will allow it to easily support finding the Kth smallest value in (log n) average case time. Then write a pseudo-code function for finding the Kth smallest value in your modified BST.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: