IfUwanna IT

💻 Jihun's Ifuwanna IT :: Tech Blog 😃

중위순회 검색 결과

해당 글 2건

[LeetCode] 94. Binary Tree Inorder Traversal - 문제풀이

Description 주어진 이진트리를 중위순회(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 순으로 순회하며 결과를 기록합니다. 시간복잡도 : O(n) 공간..

알고리즘/LeetCode 2022. 1. 28. 13:26

[LeetCode] 1305. All Elements in Two Binary Search Trees - 문제 풀이

Description Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Example 1: Input: root1 = [2,1,4], root2 = [1,0,3] Output: [0,1,1,2,3,4] Example 2: Input: root1 = [1,null,8], root2 = [8,1] Output: [1,1,8,8] Constraints: The number of nodes in each tree is in the range [0, 5000]. -10^5

알고리즘/LeetCode 2022. 1. 26. 15:30