34. Binary Tree Inorder Traversal

Write a function solve that returns the inorder traversal of a binary tree's nodes' values. The tree is represented as an array of nodes in level-order traversal. None indicates empty nodes.

Example:
Input: [1,None,2,3]
Output: [1,3,2]

Run this challenge interactively in Python or JavaScript when the app loads.