AVL Tree Insertion Task

Create an AVL tree from scratch. You will be provided with ‘N’ values representing node values you need to insert into the AVL tree. After inserting all values, return the root of the AVL tree.

Input:

The first line indicates an integer ‘T’, the number of test cases.
For each test case, the first line contains an integer ‘N’, the number of nodes.
The second line contains ‘N’ space-separated integers representing the node values to be inserted.

Output:

For each test case, output the AVL tree in level order after all insertions.
Each test case’s output should be on a new line.

Example:

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10^4
• 1 <= DATA <= 10^5

Note: You do not need to print anything as it’s already handled. Just implement the required function.