Given a sequence of integers, insert them one by one into an initially empty AVL tree

$($following the Binary Search Tree property$)$ and provide the in$-$order traversal of the tree after all

insertions.

Example:

Input: $[10,20,30,40,50,25]$

Output: In$-$order Traversal: $[10,20,25,30,40,50]$