반응형
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
- bit
- priority_queue
- React
- state
- server
- nodeJS
- c++
- treenode
- leetcode
- event
- routes
- count
- BinaryTree
- css
- array
- component
- UE5
- queue
- route
- Navigation
- Context
- node.js
- axios
- Props
- Callback
- DP
- 비트연산
- MySQL
- JSX
- map
Archives
- Today
- Total
목록Tree (1)
우사미 코딩
[Leetcode] 110. Balanced Binary Tree
1. 문제링크 Balanced Binary Tree - LeetCode Can you solve this real interview question? Balanced Binary Tree - Given a binary tree, determine if it is height-balanced. Example 1: [https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg] Input: root = [3,9,20,null,null,15,7] Output: true Exam leetcode.com 2. height-Balanced가 뭐지? 여기서 파란색 볼드를 클릭하면 height-balanced에 대한 설명이 나온다 A height-balanced bina..
Leetcode
2023. 5. 23. 04:59