| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 코드업
- sql코테
- 파이썬알고리즘
- 생성형AI
- heap
- SQL
- 파이썬
- Python
- LeetCode
- two-pointer
- 리트코드
- Greedy
- 투포인터
- dfs
- GenAI
- Python3
- stratascratch
- 릿코드
- codeup
- graph
- array
- GenerativeAI
- 니트코드
- 슬라이딩윈도우
- nlp
- 알고리즘
- tree
- BFS
- binary Tree
- Stack
- Today
- Total
목록binary Tree (8)
Tech for good
[Leetcode/Binary Tree, CBT, PBT] 222. Count Complete Tree Nodes
Completely Binary Tree (CBT)Completely Binary Tree: CBT; Perfect Binary Tree: PBT Not-efficient approach - O(n)# 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 = rightclass Solution: def countNodes(self, root: Optional[TreeNode]) -> int: if not root: ..
[Leetcode/Tree, Binary Tree, DFS] 572. Subtree of Another Tree
# 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 = rightclass Solution: def isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool: if not root: return False return self.sameTree(root, subRoot) or self.isSubtree(root..
[Leetcode/Tree, Binary Search Tree, DFS] 1305. All Elements in Two Binary Search Trees
# 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 = rightclass Solution: def getAllElements(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> List[int]: def helper(root): if not root: return [] return helper(r..
[Leetcode/Tree, Binary Tree, DFS] 110. Balanced Binary Tree
# 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 = rightclass Solution: def isBalanced(self, root: Optional[TreeNode]) -> bool: def check(node): if not node: return 0, True # height = 0, isBalanced = True lef..
[Leetcode/Tree, DFS, Binary Tree] 543. Diameter of Binary Tree
# 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 = rightclass Solution: def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int: def helper(node): if not node: return 0, 0 left_h, left_d = helper(node...
[Leetcode/Tree, Binary Tree, Binary Search Tree, Recursion] 108. Convert Sorted Array to Binary Search Tree
Solution1: using pointers (w/ helper function)# 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 = rightclass Solution: def sortedArrayToBST(self, nums: List[int]) -> TreeNode: def helper(left, right): if left > right: return None ..
[Leetcode/Tree, DFS, Binary Tree, Recursion] 112. Path Sum
Binary TreeBinary Search Tree AscendingLeft to Right # 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 = rightclass Solution: def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool: if root is None: return False if not root.l..
[Leetcode/Tree, DFS, Binary Tree, Recursion] 226. Invert Binary Tree
# 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 = rightclass Solution: def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]: # Base case: decide where to stop if root is None: return None right = self.invertT..