[LeetCode] 144. Binary Tree Preorder Traversal - 문제풀이
Description 전위 순회(preorder-traversal)하며 값을 읽어 List에 순서대로 넣어 반환하는 문제입니다. 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 순으로 전위 순회(preorder-traver..
