【LeetCode】C# 100、Same Tree

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

判断俩个二叉树是否完全相同。
思路：迭代，每次对比当前节点值，然后进入其左右节点进行下一个判断。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public bool IsSameTree(TreeNode p, TreeNode q) {
        if(p == null && q == null) return true;
        if(p == null || q == null) return false;
        if(p.val == q.val)
            return IsSameTree(p.left, q.left) && IsSameTree(p.right, q.right);
        return false;
    }
}