LeetCode.965. 单值二叉树
难度:easy
代码:
dfs:
class Solution {
public boolean isUnivalTree(TreeNode root) {
if (root == null) {
return true;
}
return dfs(root);
}
public boolean dfs(TreeNode root) {
if (root == null) {
return true;
}
if (root.left != null && root.left.val != root.val) {
return false;
}
if (root.right != null && root.right.val != root.val) {
return false;
}
return dfs(root.left) && dfs(root.right);
}
}
bfs:
bfs
class Solution {
public boolean isUnivalTree(TreeNode root) {
if (root == null) {
return true;
}
int value = root.val;
return bfs(root, value);
}
public boolean bfs(TreeNode root, int value) {
if (root == null) {
return true;
}
Queue queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
if (node.val != value) {
return false;
}
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
}
return true;
}
}



