Inorder Traversal

Given the root of a binary tree represented as an array (level order), return the inorder traversal of its nodes. Inorder traversal visits left, root, right.

Examples
Input: [1,null,2,3]
Output: [null]
Hints

Inorder Traversal

Given the root of a binary tree represented as an array (level order), return the inorder traversal of its nodes. Inorder traversal visits left, root, right.