{"id":"merge-trees-recursion-depth-equals-max-height","text":"`merge_trees` recursion depth is bounded by the height of the taller input tree — O(log n) for balanced trees, O(n) worst case for skewed trees.","truth_value":"IN","source":"entries/2026/06/06/merge-two-binary-trees-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"merge-trees-recursion-depth-equals-max-height","truth_value":"IN","reason":"premise"}]}}