Commit 7abcd3b

committed

added daily challenge

1 parent d1074f7 commit 7abcd3bCopy full SHA for 7abcd3b

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode:`
	`3`	`+# def __init__(self, val=0, left=None, right=None):`
	`4`	`+# self.val = val`
	`5`	`+# self.left = left`
	`6`	`+# self.right = right`
	`7`	`+`
	`8`	`+class Solution:`
	`9`	`+ def isEvenOddTree(self, root: Optional[TreeNode]) -> bool:`
	`10`	`+ if not root:`
	`11`	`+ return True`
	`12`	`+`
	`13`	`+ queue = deque([root])`
	`14`	`+ level = 0`
	`15`	`+`
	`16`	`+ while queue:`
	`17`	`+ prev_val = None`
	`18`	`+`
	`19`	`+ for _ in range(len(queue)):`
	`20`	`+ node = queue.popleft()`
	`21`	`+ if (level % 2 == 0 and (node.val % 2 == 0 or (prev_val is not None and node.val <= prev_val))) or \`
	`22`	`+ (level % 2 == 1 and (node.val % 2 == 1 or (prev_val is not None and node.val >= prev_val))):`
	`23`	`+ return False`
	`24`	`+`
	`25`	`+ prev_val = node.val`
	`26`	`+ if node.left:`
	`27`	`+ queue.append(node.left)`
	`28`	`+ if node.right:`
	`29`	`+ queue.append(node.right)`
	`30`	`+`
	`31`	`+ level += 1`
	`32`	`+ return True`
	`33`	`+`

Comments

(0)