965.單值二叉樹

題目

題目鏈接：https://leetcode.cn/problems/univalued-binary-tree/

題解

直接使用深度優(yōu)先搜索即可，對二叉樹進行遞歸遍歷。

class?Solution?{
????public?boolean?isUnivalTree(TreeNode?root)?{

????????if?(root?==?null)?{
????????????return?true;
????????}

????????return?isUnivalTree(root,?root.val);
????}

????public?boolean?isUnivalTree(TreeNode?root,?int?val)?{

????????if?(root?==?null)?{
????????????return?true;
????????}

????????return?root.val?==?val?&&?isUnivalTree(root.left,?val)?&&?isUnivalTree(root.right,?val);

????}

}

結(jié)果

- -