Status: IN
`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.
Source: entries/2026/06/06/merge-two-binary-trees-solution.md
JSON