avl tree in order traversal
<p>Let S be a dynamic set of integers. Let n = |S|. Describe a data structure on S to
support the following operations on S with the required performance guarantees:</p>

<p>• Insert a new element to S in O(log n) time.</p>

<p>• Delete an element from S in O(log n) time.</p>

<p>• Report the k smallest elements of S in O(k) time, for any k satisfying 1 ≤ k ≤ n.</p>

<p>Your structure must consume O(n) space at all times.</p>

<p>could i simply build an AVL tree and then preform in order traversal printing out first 3 elements? </p>