Leetcode - 相同的树

解题思路：(C#)
通过递归，前序遍历对比判断是否为相同的树。

/**
 * 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;
        }
        else if(p==null||q==null||p.val!=q.val)
        {
            return false;
        }
        else
        {
            bool IsSameLeftTree=IsSameTree(p.left,q.left);
            bool IsSmeRightTree=IsSameTree(p.right,q.right);
            return IsSameLeftTree&&IsSmeRightTree;
        }

    }
}