반응형
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
- route
- axios
- css
- React
- component
- leetcode
- c++
- map
- bit
- server
- UE5
- Props
- DP
- priority_queue
- Navigation
- MySQL
- state
- routes
- Context
- 비트연산
- event
- treenode
- nodeJS
- Callback
- BinaryTree
- node.js
- array
- count
- queue
- JSX
Archives
- Today
- Total
목록diameter (1)
우사미 코딩
[Leetcode] 543. Diameter of Binary Tree
1. 문제링크 Diameter of Binary Tree - LeetCode Can you solve this real interview question? Diameter of Binary Tree - Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path leetcode.com - Diameter : 지름 binary tree에서 제일 긴 path의 길이를 구한다 이 path는 특정노드에 대해서 가장 왼쪽 edge node ->..
Leetcode
2023. 5. 23. 06:39