951. Flip Equivalent Binary Trees
Medium
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
A binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations.
Given the roots of two binary trees root1
and root2
, return true
if the two trees are flip equivalent or false
otherwise.
Example 1:
Example 2:
Example 3:
Constraints:
The number of nodes in each tree is in the range
[0, 100]
.Each tree will have unique node values in the range
[0, 99]
.
解題
Runtime: 0 ms, faster than 100%
Memory Usage: 2.4 MB, less than 77.78%
Last updated