[LC617](https://leetcode.com/problems/merge-two-binary-trees/description/) Given two binary trees and imagine that when you put one of them to cover the other, some ...
1. DFS using depth marker: 每个depth都存一下。然后如果有不符合条件的，存为-1. 一旦有 <0 或者差值大于1， 就全部返回Integer.MIN ...
Unele rezultate au fost ascunse, deoarece pot fi inaccesibile pentru dvs.
Afișați rezultatele inaccesibile