LeetCode 333. Largest BST Subtree - 二叉搜索树（Binary Search Tree）系列题9

最新推荐文章于 2024-02-16 08:01:30 发布

CP Coding

最新推荐文章于 2024-02-16 08:01:30 发布

阅读量283

点赞数 1

分类专栏：二叉搜索树BST Leetcode刷题笔记文章标签： leetcode python 数组结构算法 BST

本文链接：https://blog.csdn.net/hgq522/article/details/122532385

版权

给定一棵二叉树，任务是找到其中最大的二叉搜索子树，要求具有最多的节点数。有效解法包括自底向上递归，检查节点值是否满足BST条件，同时统计节点数量。这种方法避免了重复计算，提高效率。

摘要由CSDN通过智能技术生成

Given the root of a binary tree, find the largest subtree, which is also a Binary Search Tree (BST), where the largest means subtree has the largest number of nodes.

A Binary Search Tree (BST) is a tree in which all the nodes follow the below-mentioned properties:

The left subtree values are less than the value of their parent (root) node's value.
The right subtree values are greater than the value of their parent (root) node's value.

Note: A subtree must include all of its descendants.

Example 1:

Input: root = [10,5,15,1,8,null,7]
Output: 3
Explanation: The Largest BST Subtree in this case is the highlighted one. The return value is the subtree's size, which is 3.

最低0.47元/天解锁文章