| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Convert Sorted List to Binary Search Tree
- t1
- DWG
- shiba
- Substring with Concatenation of All Words
- kaggle
- Protocol
- Decorator
- attribute
- Regular Expression
- 파이썬
- data science
- 시바견
- 밴픽
- 운영체제
- 컴퓨터의 구조
- 315. Count of Smaller Numbers After Self
- 109. Convert Sorted List to Binary Search Tree
- iterator
- 30. Substring with Concatenation of All Words
- Python Code
- 43. Multiply Strings
- LeetCode
- Python Implementation
- concurrency
- Python
- Generator
- Class
- 프로그래머스
- 715. Range Module
Archives
- Today
- Total
목록100. Same Tree (1)
Scribbling
LeetCode: 100. Same Tree
BFS로 순회해보자 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right from collections import deque class Solution: def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool: if p == None and q == None: return True if p == None and q != None: return False if p != None and q =..
Computer Science/Coding Test
2021. 10. 11. 00:23