Leetcode 333. Largest BST Subtree

Given a binary tree, find the size (number of nodes) of the largest subtree that is a valid binary search tree. The challenge is to verify BST properties for every subtree while aggregating sizes (typically with a bottom-up traversal) to compute the maximum efficiently.