Last active
January 5, 2019 21:57
-
-
Save mofas/15293c7d8da7dd6a51d1eee899a5f0b1 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class TreeNode: | |
def __init__(self, x): | |
self.val = x | |
self.left = None | |
self.right = None | |
class Solution: | |
def isUnivalTree(self, root): | |
""" | |
:type root: TreeNode | |
:rtype: bool | |
""" | |
if root == None: | |
return True | |
def helper(node): | |
if node == None: | |
return True | |
return node.val == root.val and helper(node.left) and helper( | |
node.right) | |
return helper(root) | |
solver = Solution() | |
root1 = TreeNode(1) | |
node1 = TreeNode(1) | |
node2 = TreeNode(1) | |
node3 = TreeNode(1) | |
node4 = TreeNode(1) | |
node5 = TreeNode(1) | |
root1.left = node1 | |
root1.right = node2 | |
node1.left = node3 | |
node1.right = node4 | |
node2.right = node5 | |
print(solver.isUnivalTree(root1)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment