文件: root - text - article - 2019 - 11 - deepest-node-in-a-binary-tree.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 481 次阅读, 22475 次搜索 | 106 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 481 次阅读, 22475 次搜索 | 106 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:
You are given the root of a binary tree. Return the deepest node (the furthest node from the root).
Example:
The deepest node in this tree is d at depth 3.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 481 次阅读, 22475 次搜索 | 106 个单词 You are given the root of a binary tree. Return the deepest node (the furthest node from the root).
Example:
a
/ \
b c
/
d
The deepest node in this tree is d at depth 3.
Here's a starting point:
class Node(object):
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def __repr__(self):
# string representation
return self.val
def deepest(node):
# Fill this in.
root = Node('a')
root.left = Node('b')
root.left.left = Node('d')
root.right = Node('c')
print deepest(root)
# (d, 3)
猜您喜欢...
- First and Last Indices of an Element in a Sorted Array
- Skip the readings, focus on problems. And use all the hints!
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Algorithm Interview: Subarray With Target Sum
- Compare Version Numbers
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Daily Interview Question: Create a Simple Calculator
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Algorithm Interview: Longest Consecutive Sequence
- Algorithm Interview: Convert Roman Numerals to Decimal
©2006~2024 牛排过熟 - 0.00772 秒 - 2629.187 KB/s - 26 在线 内存: 492.74 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。