File: root - text - article - 2020 - 02 - most-frequent-subtree-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 501 Views, 22975 Search Bots | 147 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 501 Views, 22975 Search Bots | 147 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by LinkedIn:
Given a binary tree, find the most frequent subtree sum.
Example:
The above tree has 3 subtrees. The root node with 3, and the 2 leaf nodes, which gives us a total of 3 subtree sums. The root node has a sum of 1 (3 + 1 + -3), the left leaf node has a sum of 1, and the right leaf node has a sum of -3. Therefore the most frequent subtree sum is 1.
If there is a tie between the most frequent sum, you can return any one of them.
Here's some starter code for the problem:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 501 Views, 22975 Search Bots | 147 Words Given a binary tree, find the most frequent subtree sum.
Example:
3
/ \
1 -3
The above tree has 3 subtrees. The root node with 3, and the 2 leaf nodes, which gives us a total of 3 subtree sums. The root node has a sum of 1 (3 + 1 + -3), the left leaf node has a sum of 1, and the right leaf node has a sum of -3. Therefore the most frequent subtree sum is 1.
If there is a tie between the most frequent sum, you can return any one of them.
Here's some starter code for the problem:
class Node():
def __init__(self, value, left=None, right=None):
self.val = value
self.left = left
self.right = right
def most_freq_subtree_sum(root):
# fill this in.
root = Node(3, Node(1), Node(-3))
print(most_freq_subtree_sum(root))
# 1
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: 3 Sum
- Reverse a Linked List
- Daily Interview Problem: Largest BST in a Binary Tree
- Fix Brackets
- Spectrum Master
- Daily Interview Problem: Spiral Traversal of Grid
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Merge List Of Number Into Ranges
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem: Find the Number of Islands
©2006~2024 SteakOverCooked - 0.01197 Seconds(s) - 1686.857 KB/s - 12 Online
Memory: 492.31 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !