Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 |
Tags
- easy
- tree
- 리트코드
- Python
- 이진트리
- binary tree
- 중간
- string
- Binary
- Depth-first Search
- binary search
- recursive
- 쉬움
- matrix
- linked list
- HashTable
- 미디움
- backtracking
- list
- Array
- 재귀
- two pointers
- DP
- leetcode
- dfs
- hash table
- Medium
- math
- 문자열
- sorting
Archives
- Today
- Total
목록Populating Next Right Pointers in Each Node II (1)
부부의 코딩 성장 일기
LeetCode 117(Populating Next Right Pointers in Each Node II )
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 ..
Algorithm/LeetCode
2024. 3. 3. 19:00