Welcome to your interview.
The question is on your right: Balance Trees with AVL or Red-Black. Take a moment with it first.
Talk your thinking through with me if you like - when you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes). Discussion and graded submissions share your five interviewer interactions, so spend them well.
Walk through the implementation of a binary search tree and explain how you would balance it to create an AVL or Red-Black Tree.