Question $3$

Insert the following keys into an initially empty AVL Tree and then perform a standard $($left to

right by levels$)$ level order traversal:

Insert $25,$

Insert $19,$

Insert $15,$

Insert $16,$

Insert $17,$

Insert $29,$

Insert $27$

Note: Enter the level order traversal of elements with each key separated by a space,

example: $543$