FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

LeetCode-Solutions/Python/univalued-binary-tree.py at master · Monika-R/LeetCode-Solutions · GitHub

39 lines (34 loc) · 953 Bytes

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

32

33

34

35

36

37

38

39

# Time: O(n)

# Space: O(h)

# Definition for a binary tree node.

class TreeNode(object):

def __init__(self, x):

self.val = x

self.left = None

self.right = None

class Solution(object):

def isUnivalTree(self, root):

"""

:type root: TreeNode

:rtype: bool

"""

s = [root]

while s:

node = s.pop()

if not node:

continue

if node.val != root.val:

return False

s.append(node.left)

s.append(node.right)

return True

# Time: O(n)

# Space: O(h)

class Solution2(object):

def isUnivalTree(self, root):

"""

:type root: TreeNode

:rtype: bool

"""

return (not root.left or (root.left.val == root.val and self.isUnivalTree(root.left))) and \

(not root.right or (root.right.val == root.val and self.isUnivalTree(root.right)))

Back | FazBrowse Home | New Git URL