Skip to content

Files

Latest commit

May 19, 2024
7a5373a · May 19, 2024

History

History
59 lines (35 loc) · 831 Bytes

problem.md

File metadata and controls

59 lines (35 loc) · 831 Bytes

144. Binary Tree Preorder Traversal

Given the root of a binary tree, return the preorder traversal of its nodes' values.

Example 1:

img

Input: root = [1,null,2,3]
Output: [1,2,3]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

Example 4:

img

Input: root = [1,2]
Output: [1,2]

Example 5:

img

Input: root = [1,null,2]
Output: [1,2]

Constraints:

  • The number of nodes in the tree is in the range [0, 100].
  • -100 <= Node.val <= 100

Follow up:

Recursive solution is trivial, could you do it iteratively?