【题目】
【代码】
简单的层次遍历,及记录所在的层次,根据题目给出的描述:
- level是奇数层的话,只允许存在偶数,且节点从左到右是严格遵守递减的顺序的偶数。
- level是偶数层的话,只允许存在奇数,且节点从左到右是严格遵守 递减的顺序的奇数。
# 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 isEvenOddTree(self, root: Optional[TreeNode]) -> bool:
if root.val%2==0:return False
queue=[root]
level=0
ans=True
while queue:
sz=len(queue)
pre=-1
for i in range(sz):
temp=queue.pop(0)
if level%2==0:
if (pre==-1 and temp.val%2==0) or (pre!=-1 and (temp.val<=pre or temp.val%2==0)):
ans=False
break
elif (pre==-1 and temp.val%2==1) or (pre!=-1 and (temp.val>=pre or temp.val%2==1)):
ans=False
break
pre=temp.val
if temp.left:
queue.append(temp.left)
if temp.right:
queue.append(temp.right)
level+=1
return ans