Given the roots of two binary trees, determine whether they are structurally identical and have the same node values at every position. Return true or false. The input gives two level-order arrays separated by ' | '.
Input: Two level-order arrays separated by ' | '.
Output: Boolean — true or false.
Input: [1,2,3] | [1,2,3]
Output: true
Explanation: Same structure and values.Input: [1,2,3] | [1,2,4]
Output: false
Explanation: Values differ.Input: [] | []
Output: true
Explanation: Both empty.0<=nodes<=10^4-1000<=value<=1000