부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 아래 형태의 binary tree가 주어졌을 때 struct Node { int val; Node *left; Node ..

1. 문제 링크 https://leetcode.com/problems/path-sum-ii/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 이진트리의 root와 targetSum이라는 정수가 주어졌을 때, 각 노드의 합이 targetSum과 같으면서 root-to-leaf로 가는 모든 path를 구해서 list에 저장하여..

1. 문제 링크 https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 이진트리의 root가 주어졌을 때, bottom-up level order traversal을 반환 여기서 bottom-up leverl ..

1. 문제 링크 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 preorder, inorder에 대한 array가 주어졌을 때, 여기서 preorder는 이진트리의 preorder tr..

1. 문제 링크 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 binary tree의 root가 주어졌을 때, level 별로 zigzag 순서로 nodes의 값을 적재하여 반환 level 0에서 왼쪽 → 오른쪽으로..

1. 문제 링크 https://leetcode.com/problems/binary-tree-paths/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 binary tree의 root가 주어졌을 때, root부터 leaf까지 가는 모든 paths를 list에 append하여 반환 여기서 leaf란 children이 없는 n..

1. 문제 링크 https://leetcode.com/problems/invert-binary-tree/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 binary tree의 root가 주어졌을 때, 이를 invert한 root를 반환 예시) input이 [4,2,7,1,3,6,9] 이면 output이 [4,7,2,9,6,3,1]로 각 노드의..

1. 문제 링크 https://leetcode.com/problems/unique-binary-search-trees/description/ Unique Binary Search Trees - LeetCode Can you solve this real interview question? Unique Binary Search Trees - Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. Example 1: [https://assets.leetcode leetcode.com 2. 문제 설명 정수 n이..