【LeetCode】739.Even Odd Tree （BFS宽度优先搜索）

【LeetCode】739.Even Odd Tree （BFS宽度优先搜索）

A binary tree is named Even-Odd if it meets the following conditions:

The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc.
For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
Given the root of a binary tree, return true if the binary tree is Even-Odd, otherwise return false.

思路

目的为求一个棵树是否为“奇偶树”。判断条件为每偶数层的节点需为一组递增的奇数，而每奇数层的节点需为递减的偶数。

有关层数的题基本都可以用队列来解，即用来暂存每一层节点的值进行判断。每个节点都根据规则判断，不符合条件的直接返回，符合条件的放行把节点下一层的左右子节点存入队列中。

实现

public boolean isEvenOddTree(TreeNode root) {
        if(root==null)
            return true;
        Queue<TreeNode> queue=new LinkedList<>();
        queue.add(root);
        int level=0;
        while(!queue.isEmpty()){
            int size=queue.size();
            int par=0;
            for(int i=0;i<size;i++){
                TreeNode node=queue.poll();
                
                // check odd level
                if(level%2!=0&&(node.val%2!=0||(i>0&&par<=node.val)))
                    return false;
                // check even level
                if(level%2==0&&(node.val%2==0||(i>0&&par>=node.val)))
                    return false;
                
                // save next level's node 
                if(node.left!=null)
                    queue.add(node.left);
                if(node.right!=null)
                    queue.add(node.right);
                par=node.val;
            }
            level++;
        }
        return true;
    }