{"id":"diameter-not-necessarily-through-root","text":"The diameter algorithm correctly finds longest paths that don't pass through the root by checking `left_height + right_height` at every node during the DFS, not just at the root.","truth_value":"IN","source":"entries/2026/06/06/diameter-of-binary-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"diameter-not-necessarily-through-root","truth_value":"IN","reason":"premise"}]}}