913. Check if Two Trees are Isomorphic

Given two binary trees, determine whether they are isomorphic — one can be obtained from the other by swapping the left and right children of some nodes (any number of them). Matching nodes must hold equal values. 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.

Examples

Input: [1,2,3,4] | [1,3,2,null,null,null,4]
Output: true
Explanation: Swapping children makes them match.

Input: [1,2,3] | [1,2,4]
Output: false
Explanation: Values differ.

Input: [1] | [1]
Output: true
Explanation: Single matching node.

Constraints

• 0<=nodes<=10^4
• -1000<=value<=1000

Asked by