Grokking the Engineering Manager Coding Interview
0% completed
Even Odd Tree (medium)
Problem Statement
Given a binary tree, return true if it is an Even-Odd tree. Otherwise, return false.
The Even-odd tree must follow below two rules:
- At every
even-indexedlevel (starting from 0), all node values must beoddand arranged instrictly increasingorder fromlefttoright. - At every
odd-indexedlevel, all node values must beevenand arranged instrictly decreasingorder fromlefttoright.
Examples
Example 1
- Input:
1
/ \
10 4
/ \
3 7
- Expected Output:
true
.....
.....
.....
Like the course? Get enrolled and start learning!
Lily jiang
· 2 days ago
def isEvenOddTree(self, root: TreeNode) -> bool: queue = deque([root]) even = True while queue: level=[] for _ in range(len(queue)): node = queue.popleft() level.append(node.val) if node.left: queue.append(node.left) if node.right: queue.append(node.right) if not self.evenodd(level, even): return False even = not even return True def evenodd(self,level, even): i =0 while i < len(level): if even: if level[i] %2 != 1: return False if i>=1 and level[i] <= level[i-1
Reading Progress
0%