Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.