azl397985856/leetcode

【每日一题】- 2021-07-30 - 最大的二叉搜索子树

azl397985856 opened this issue · 1 comments

azl397985856 commented

给你一个树，让你求这棵树的最大的子树的大小，该子树需要是一个 BST （二叉搜索树）。

函数输入为树的根节点，返回值为数字，表示子树大小。

def findMaxBSTSubTree(root:TreeNode)->int:
	pass
stale commented

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.