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.

【题意】

            判断二叉树是否相同

【分析】

            分治的思想，如果根节点相等，在判断左右孩子是否相等，依次遍历每一个点，如果都为Null或是都不为null且值相等 返回true,一个为Null另一个不为Null返回false 两个都不为null但值不相等返回false。

【实现】

             

<span style="font-size:14px;"></span><pre name="code" class="java" style="font-weight: bold;">/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

</pre><pre name="code" class="java"><span style="font-size:14px;">public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        boolean flag = false;
        if(p==null && q == null)
            return true;
        if(p == null && q!= null)
            return false;
        if(p!= null && q== null)
            return false;
        if(p.val != q.val)
            return false;
        return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
        
    }
}</span>