/************************************************************************/

        /*       36:      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.

         * */

        

        //判断两个二叉树是否完全一致 (递归解法)

 

private Boolean IsSame(TreeNode nodeleft,TreeNode noderight)         {            if(nodeleft==null&&noderight==null)            {                return true;            }            if(nodeleft==null||noderight==null)            {                return false;            }            return nodeleft.val==noderight.val&&IsSame(nodeleft.left, noderight.left)&&IsSame(nodeleft.right, noderight.right);        }                public boolean isSameTree(TreeNode p, TreeNode q)         {            return IsSame(p,q);        }