FunctionRacerProblemsRace

Binary Tree Preorder Traversal

BeginnerTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the values of the tree in preorder: a node first, then its whole left subtree, then its whole right subtree. An empty tree gives an empty list.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [1,2,3]
returns [1,2,3]

Visit 1, then the left child 2, then the right child 3.

Example 2

root [1,null,2,3]
returns [1,2,3]

1, then its right subtree: 2, whose left child is 3.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems