【Leetcode-每日一题】单值二叉树

单值二叉树
难度：简单


模拟过程判断即可。
代码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
 
    public boolean isUnivalTree(TreeNode root) {
        int value = root.val;
        Deque<TreeNode> deque = new ArrayDeque<>();
        deque.add(root);
        while(!deque.isEmpty()){
            TreeNode poll = deque.poll();
            if(poll.val!=value){
                return false;
            }
            if(poll.left!=null){
                deque.add(poll.left);
            }
            if(poll.right!=null){
                deque.add(poll.right);
            }
        }
        return true;
    }
}

执行结果：成功