leetcode - 2265. Count Nodes Equal to Average of Subtree

Description

Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree.

Note:

复制代码
The average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.
A subtree of root is a tree consisting of root and all of its descendants.

Example 1:

复制代码
Input: root = [4,8,5,0,1,null,6]
Output: 5
Explanation: 
For the node with value 4: The average of its subtree is (4 + 8 + 5 + 0 + 1 + 6) / 6 = 24 / 6 = 4.
For the node with value 5: The average of its subtree is (5 + 6) / 2 = 11 / 2 = 5.
For the node with value 0: The average of its subtree is 0 / 1 = 0.
For the node with value 1: The average of its subtree is 1 / 1 = 1.
For the node with value 6: The average of its subtree is 6 / 1 = 6.

Example 2:

复制代码
Input: root = [1]
Output: 1
Explanation: For the node with value 1: The average of its subtree is 1 / 1 = 1.

Constraints:

复制代码
The number of nodes in the tree is in the range [1, 1000].
0 <= Node.val <= 1000

Solution

Use post-order, keep track of the sum of the value of all the children, and the number of the children.

Time complexity: o ( n ) o(n) o(n)

Space complexity: o ( n ) o(n) o(n)

Code

python3 复制代码
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def averageOfSubtree(self, root: Optional[TreeNode]) -> int:
        stack = [(root, 0)]
        res = 0
        node_info = {}
        while stack:
            node, stat = stack.pop()
            if stat == 0:
                stack.append((node, 1))
                if node.left:
                    stack.append((node.left, 0))
                if node.right:
                    stack.append((node.right, 0))
            else:
                if not node.left and not node.right:
                    node_info[node] = (node.val, 1)
                elif not node.left:
                    node_info[node] = (node.val + node_info[node.right][0], 1 + node_info[node.right][1])
                elif not node.right:
                    node_info[node] = (node.val + node_info[node.left][0], 1 + node_info[node.left][1])
                else:
                    left_sum, left_num = node_info[node.left]
                    right_sum, right_num = node_info[node.right]
                    node_info[node] = (node.val + left_sum + right_sum, 1 + left_num + right_num)
                if node.val == node_info[node][0] // node_info[node][1]:
                    res += 1
        return res
相关推荐
武子康1 小时前
AI-调查研究-76-具身智能 当机器人走进生活:具身智能对就业与社会结构的深远影响
人工智能·程序人生·ai·职场和发展·机器人·生活·具身智能
纪元A梦2 小时前
贪心算法应用:配送路径优化问题详解
算法·贪心算法
C_player_0012 小时前
——贪心算法——
c++·算法·贪心算法
kyle~4 小时前
排序---插入排序(Insertion Sort)
c语言·数据结构·c++·算法·排序算法
Boop_wu4 小时前
[数据结构] 队列 (Queue)
java·jvm·算法
Nan_Shu_6144 小时前
Web前端面试题(1)
前端·面试·职场和发展
hn小菜鸡4 小时前
LeetCode 3643.垂直翻转子矩阵
算法·leetcode·矩阵
ゞ 正在缓冲99%…5 小时前
leetcode101.对称二叉树
算法
YuTaoShao6 小时前
【LeetCode 每日一题】3000. 对角线最长的矩形的面积
算法·leetcode·职场和发展
2zcode6 小时前
基于Matlab可见光通信系统中OOK调制的误码率性能建模与分析
算法·matlab·php