Given the roots of two binary trees p
and q
, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
Example 1:
Input: p = [1,2,3], q = [1,2,3] Output: true
Example 2:
Input: p = [1,2], q = [1,null,2] Output: false
Example 3:
Input: p = [1,2,1], q = [1,1,2] Output: false
Constraints:
[0, 100]
.-104 <= Node.val <= 104
struct Solution;
use rustgym_util::*;
impl Solution {
fn is_same_tree(p: TreeLink, q: TreeLink) -> bool {
p == q
}
}
#[test]
fn test() {
let q = tree!(
1,
tree!(2, tree!(1), tree!(1)),
tree!(2, tree!(1), tree!(1))
);
let p = tree!(
1,
tree!(2, tree!(1), tree!(1)),
tree!(2, tree!(1), tree!(1))
);
let res = true;
assert_eq!(Solution::is_same_tree(p, q), res);
}