文件: root - text - article - 2020 - 02 - binary-tree-level-with-minimum-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 493 次阅读, 24892 次搜索 | 111 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 493 次阅读, 24892 次搜索 | 111 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Twitter:
You are given the root of a binary tree. Find the level for the binary tree with the minimum sum, and return that value.
For instance, in the example below, the sums of the trees are 10, 2 + 8 = 10, and 4 + 1 + 2 = 7. So, the answer here should be 7.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 493 次阅读, 24892 次搜索 | 111 个单词 You are given the root of a binary tree. Find the level for the binary tree with the minimum sum, and return that value.
For instance, in the example below, the sums of the trees are 10, 2 + 8 = 10, and 4 + 1 + 2 = 7. So, the answer here should be 7.
class Node:
def __init__(self, value, left=None, right=None):
self.val = value
self.left = left
self.right = right
def minimum_level_sum(root):
# Fill this in.
# 10
# / \
# 2 8
# / \ \
# 4 1 2
node = Node(10)
node.left = Node(2)
node.right = Node(8)
node.left.left = Node(4)
node.left.right = Node(1)
node.right.right = Node(2)
print minimum_level_sum(node)
猜您喜欢...
- Algorithm Interview: Convert Roman Numerals to Decimal
- Maximum In A Stack
- Daily Interview Problem: Validate Binary Search Tree
- Invert a Binary Tree
- Most Frequent Subtree Sum
- Autorun.inf Virus Protection
- Patterns for breaking down questions you haven
- A trick for getting good at coding interviews FASTER
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- Progess made
©2006~2024 牛排过熟 - 0.00755 秒 - 2746.04 KB/s - 23 在线 内存: 494.09 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。