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
- 리트코드
- linked list
- leetcode
- Array
- recursive
- matrix
- Medium
- 문자열
- string
- easy
- backtracking
- dfs
- binary tree
- 쉬움
- 재귀
- Python
- tree
- hash table
- math
- Depth-first Search
- HashTable
- binary search
- 이진트리
- DP
- 중간
- sorting
- Binary
- 미디움
- two pointers
- list
Archives
- Today
- Total
목록Binary Tree Preorder Traversal (1)
부부의 코딩 성장 일기
LeetCode 144(Binary Tree Preorder Traversal, Python)
1. 문제 링크 https://leetcode.com/problems/binary-tree-preorder-traversal/ Binary Tree Preorder Traversal - LeetCode Can you solve this real interview question? Binary Tree Preorder Traversal - Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: [https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg] Input: root = [1, leetcode.com 2. 문제 설명 이진 트리의 r..
Algorithm/LeetCode
2023. 12. 2. 19:00