文件: root - text - article - 2019 - 11 - get-all-values-at-a-certain-height-in-a-binary-tree.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 484 次阅读, 27747 次搜索 | 81 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 484 次阅读, 27747 次搜索 | 81 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Amazon:
Given a binary tree, return all values given a certain height h.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 484 次阅读, 27747 次搜索 | 81 个单词 Given a binary tree, return all values given a certain height h.
Here's a starting point:
class Node():
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right
def valuesAtHeight(root, height):
# Fill this in.
# 1
# / \
# 2 3
# / \ \
# 4 5 7
a = Node(1)
a.left = Node(2)
a.right = Node(3)
a.left.left = Node(4)
a.left.right = Node(5)
a.right.right = Node(7)
print valuesAtHeight(a, 3)
# [4, 5, 7]
猜您喜欢...
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Longest Substring With K Distinct Characters
- CPU Utilization
- Binary Tree Level with Minimum Sum
- Sorting a list with 3 unique numbers
- Patterns for breaking down questions you haven
- Algorithm Interview Question: Symmetric k-ary Tree
- Algorithm Interview: Longest Consecutive Sequence
- Algorithm Interview: Subarray With Target Sum
- Daily Interview Problem: Running Median
©2006~2024 牛排过熟 - 0.01268 秒 - 1603.192 KB/s - 35 在线 内存: 493.07 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。