{"id":"mindepth-bfs-over-dfs","text":"`minDepth` uses BFS (level-order traversal) rather than DFS so it can return immediately at the first leaf encountered, avoiding full-tree traversal on unbalanced trees.","truth_value":"IN","source":"entries/2026/06/06/minimum-depth-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":"mindepth-bfs-over-dfs","truth_value":"IN","reason":"premise"}]}}