835. Inorder Traversal of Binary Tree

Given the root of a binary tree, return its inorder traversal (left subtree, node, right subtree) as an array of node values. The tree is given as a level-order array with null for missing children.

Input: A level-order array of the tree (null for missing nodes).

Output: Array — node values in inorder.

Examples

Input: [1,2,3,4,5,null,6]
Output: [4,2,5,1,3,6]
Explanation: Left, root, right order.

Input: [1]
Output: [1]
Explanation: Single node.

Input: []
Output: []
Explanation: Empty tree.

Constraints

• 0<=nodes<=10^4
• -1000<=value<=1000

Asked by