Closed umdreamer closed 1 year ago
Given the root of a binary tree, return the preorder traversal of its nodes' values.
Example 1:
Input: root = [1,null,2,3] Output: [1,2,3]
Example 2:
Input: root = [] Output: []
Example 3:
Input: root = [1] Output: [1]
Constraints:
[0, 100].
-100 <= Node.val <= 100
Given the root of a binary tree, return the preorder traversal of its nodes' values.
Example 1:
Example 2:
Example 3:
Constraints:
[0, 100].
-100 <= Node.val <= 100