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 | 31 |
Tags
- easy
- tree
- hash table
- binary search
- backtracking
- Depth-first Search
- binary tree
- 중간
- linked list
- Python
- 쉬움
- Binary
- list
- 이진트리
- sorting
- math
- string
- DP
- dfs
- 재귀
- 미디움
- 리트코드
- matrix
- Medium
- leetcode
- HashTable
- two pointers
- recursive
- 문자열
- Array
Archives
- Today
- Total
목록leetcode 111 (1)
부부의 코딩 성장 일기
LeetCode 111(Minimum Depth of Binary Tree, Python)
1. 문제 링크 Minimum Depth of Binary Tree - LeetCode Minimum Depth of Binary Tree - LeetCode Can you solve this real interview question? Minimum Depth of Binary Tree - Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a no leetcode.com 2. 문제 설명 이진 트리 구조가 주어졌을 때 Minimum Depth를..
Algorithm/LeetCode
2023. 11. 20. 19:00