{"id":"max-depth-nary-depth-convention","text":"Depth is 1-indexed across tree problems: a single-node tree returns 1, an empty tree returns 0.","truth_value":"IN","source":"entries/2026/06/06/maximum-depth-of-n-ary-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"max-depth-nary-depth-convention","truth_value":"IN","reason":"premise"}]}}