71. Binary Tree Preorder Traversal

Write solve for the preorder traversal of a binary tree. Return the list of values in preorder.

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

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