반응형 전체 글88 LeetCode - Binary Tree Postorder Traversal Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [3,2,1] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Constraints: The number of the nodes in the tree is in the range [0, 100]. -100 root)를 풀이하였다. /** * Example: * var ti = TreeNode(5) * var v = ti.`val` * Definition for a binary t.. 2022. 9. 30. 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. LeetCode - Binary Tree Inorder Traversal Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] 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 tree no.. 2022. 9. 30. LeetCode - Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: 1 2022. 9. 30. 이전 1 ··· 4 5 6 7 8 9 10 ··· 22 다음 반응형
