Inorder Traversal

Given a binary tree, print its nodes in Left -> Root -> Right (inorder) order.

The tree is given in level order: M tokens, each an integer or null. The first token is the root; null marks a missing child. Children of a null are not listed.

Input Format

The first line contains an integer M, the number of level-order tokens. The second line contains M space-separated tokens (integers or null). It is blank when M is 0.

Output Format

Print the inorder traversal values separated by single spaces, or an empty line for an empty tree.