반응형 Computer/Algorithm88 LeetCode - Binary Tree Preorder Traversal 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: The number of nodes in the tree is in the range [0, 100]. -100 right)를 활용하여 풀이하였다. /** * Example: * var ti = TreeNode(5) * var v = ti.`val` * Definition for a binary .. 2022. 9. 30. 이전 1 ··· 23 24 25 26 27 28 29 ··· 88 다음 반응형
