2022-05-24

[Zheaoli]

2022-05-24

[SaraadKun]

965. 单值二叉树

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

    private boolean dfs(TreeNode root, int target) {
        if (root == null) {
            return true;
        }
        return root.val == target && dfs(root.left, target) && dfs(root.right, target);

    }
}

---

WeChat: Saraad

[dreamhunter2333]

package main

/*
 * @lc app=leetcode.cn id=965 lang=golang
 *
 * [965] 单值二叉树
 */
type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

// @lc code=start
func isUnivalTree(root *TreeNode) bool {
    if root == nil {
        return true
    }
    stack := make([]*TreeNode, 0)
    stack = append(stack, root)
    val := root.Val
    for len(stack) > 0 {
        node := stack[len(stack)-1]
        stack = stack[:len(stack)-1]
        if node.Val != val {
            return false
        }
        if node.Left != nil {
            stack = append(stack, node.Left)
        }
        if node.Right != nil {
            stack = append(stack, node.Right)
        }
    }
    return true
}

// @lc code=end

---

微信id: 而我撑伞 来自 vscode 插件