LeetCode - 965. 单值二叉树

其实这种算法还可以优化的，因为如果判断到root.val !== val的时候已经可以终止递归了…

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {boolean}
 */
var isUnivalTree = function(root) {
    let val = root.val
    let isUnivalTreeFlag = true
    const traversal = (root) => {
        if(!root) return
        if(root.val !== val){
            isUnivalTreeFlag = false
        }
        traversal(root.left)
        traversal(root.right)
    }
    traversal(root)
    return isUnivalTreeFlag
};