文件: root - text - article - 2019 - 12 - largest-bst-in-a-binary-tree.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 416 次阅读, 22127 次搜索 | 118 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 416 次阅读, 22127 次搜索 | 118 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Twitter:
You are given the root of a binary tree. Find and return the largest subtree of that tree, which is a valid binary search tree.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 416 次阅读, 22127 次搜索 | 118 个单词 You are given the root of a binary tree. Find and return the largest subtree of that tree, which is a valid binary search tree.
Here's a starting point:
class TreeNode:
def __init__(self, key):
self.left = None
self.right = None
self.key = key
def __str__(self):
# preorder traversal
answer = str(self.key)
if self.left:
answer += str(self.left)
if self.right:
answer += str(self.right)
return answer
def largest_bst_subtree(root):
# Fill this in.
# 5
# / \
# 6 7
# / / \
# 2 4 9
node = TreeNode(5)
node.left = TreeNode(6)
node.right = TreeNode(7)
node.left.left = TreeNode(2)
node.right.left = TreeNode(4)
node.right.right = TreeNode(9)
print largest_bst_subtree(node)
#749
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Problem: Look and Say Sequence
- Daily Interview Problem:Create a balanced binary search tree
- Kaprekar
- Delphi Dynamic Array
- Reverse a Directed Graph
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- ImageMagick Vulnerabilities - CVE-2016–3714
- Most Frequent Subtree Sum
- Find Missing Numbers in an Array
©2006~2024 牛排过熟 - 0.00808 秒 - 2508.33 KB/s - 9 在线
内存: 493.71 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="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。