| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 스프링부트
- NIO
- alter
- deque
- CSS
- priority_queue
- math
- dfs
- 스택
- 리소스모니터링
- BFS
- spring boot
- set
- html
- scanner
- Calendar
- List
- JPA
- sql
- string
- union_find
- 힙덤프
- date
- GC로그수집
- Java
- javascript
- map
- 큐
- Union-find
- Properties
- Today
- Total
목록알고리즘/Tree (8)
매일 조금씩
Leet code (Easy): 226. Invert Binary Tree - Java
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public TreeNode invertTree(TreeNod..
Leet code (Easy): 100. Same Tree - Java
같은 트리인지를 판별하는 아주 기본적인 문제이다. /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public..