Tier 4 — Recursive Decision Trees, Structural Induction & Subtree Contracts
M4.3: The Inherited (min, max) Corridor
Bottleneck: The brute-force bottleneck this module eliminates — see M4.3-bst-constraints-and-reconstruction/README.md.
Pre-launch
This module is still in the pre-launch phase.
This site is a YC preview. Only M0.1 — memory boxes and the 10^8 ops/sec clock — ships video, audio, the quiz, and the toy. M4.3 stays on the syllabus so the map is honest; the filmed lesson is not in this build.
Open the live M0.1 lesson →Planned problems · 4
- Validate Binary Search Tree
- Kth Smallest in a BST
- Construct from Preorder & Inorder
- Serialize and Deserialize