Univalued Binary Tree | LeetCode | Java

RMAG news
class Solution {
public boolean isUnivalTree(TreeNode root) {
return checkUniValue(root, root.val);
}

boolean checkUniValue(TreeNode node, int val){
if(node==null)
return true;

if(node.val!=val)
return false;

return (checkUniValue(node.left, val) && checkUniValue(node.right, val));
}
}

Thanks for reading 🙂
Feel free to comment and like the post if you found it helpful
Follow for more 🤝 && Happy Coding 🚀

If you enjoy my content, support me by following me on my other socials:
Youtube
Github
Twitter(X)
Medium