Practice Count Nodes With the Highest Score
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There is a binary tree rooted at 0 consisting of n nodes. The nodes are labeled from 0 to n - 1. You are given a 0-indexed integer array parents representing the tree, where parents[i] is the parent of node i. Since node 0 is the root, parents[0] == -1. Each node has a score. To find the score of a node, consider if the node and the edges connected to it were removed. The tree would become one or more non-empty subtrees. The size of a subtree is the number of the nodes in it. The score of the node is the product of the sizes of all those subtrees. Return the number of nodes that have the highest score.
Source: Count Nodes With the Highest Score on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
parents = [-1,2,0,2,0]
3
# Example 2
parents = [-1,2,0]
2
Constraints
Related LeetCode Problems
Practice more problems similar to Count Nodes With the Highest Score.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.