Difficulty Level: MEDIUM
Problem Statement:
Given a binary tree and a key, insert the key into the binary tree at the first position available in level order.
Input:
Key = 32
Output:
Inorder traversal before insertion:5 12 20 10 8 3
Inorder traversal after insertion:5 12 32 20 10 8 3