binary tree5 [LEET CODE] 617. Merge Two Binary Trees # Problem You are given two binary trees root1 and root2. Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the no.. 2021. 4. 20. [LEET CODE] 226. Invert Binary Tree # Problem Given the root of a binary tree, invert the tree, and return its root. Constraints: The number of nodes in the tree is in the range [0, 100]. -100 TreeNode: if root: root.left, root.right = \ self.invertTree(root.right), self.invertTree(root.left) return root return None return None은 생략가능 ( 파이썬은 자동으로 None 리턴 ) # Solution 2 - 반복구조로 BFS class Solution: def invertTree(self, root: TreeNode.. 2021. 4. 20. ❗️[LEET CODE] 687. Longest Univalue Path # Problem Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass through the root. The length of the path between two nodes is represented by the number of edges between them. Constraints: The number of nodes in the tree is in the range [0, 104]. -1000 2021. 4. 20. [LEET CODE] 543. Diameter of Binary Tree # Problem 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 may or may not pass through the root. The length of a path between two nodes is represented by the number of edges between them. Constraints: The number of nodes in the tree is in the range [1, 104]. -.. 2021. 4. 19. [LEET CODE] 104. Maximum Depth of Binary Tree # Problem Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Constraints: The number of nodes in the tree is in the range [0, 104]. -100 int: if root is None: return 0 queue = collections.deque([root]) depth = 0 while queue: depth += 1 # 큐 연산 추출 노드의 자식 노드 삽입 for .. 2021. 4. 15. 이전 1 다음 반응형
