python-algorithm
leetcode 2236. Root Equals Sum of Children
무적김두칠
2022. 7. 7. 10:07
|
1
2
3
4
5
6
7
8
9
10
11
12
|
# 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
class Solution:
def checkTree(self, root: Optional[TreeNode]) -> bool:
if root.val == root.left.val+root.right.val :
return True
else :
return False
|
cs |
반응형