leetcode解题之100# Same Tree Java版

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.

给定两个二叉树，判断这两棵树是否相等。
仅当两棵树的结构相同，结点值都相等时都会相等。

使用递归进行求解，先判断当前结点值是否相等，如果相等就再比较其左右子树，只有当所有的结点都相等才相等。

   //树节点
	public class TreeNode {
		    int val;
		      TreeNode left;
		      TreeNode right;
		      TreeNode(int x) { val = x; }
		  }

 public boolean isSameTree(TreeNode p, TreeNode q) {
		 if(p==null&&q==null)
			 return true;
		 if(p!=null&&q==null)
			 return false;
		 if(p==null&&q!=null)
			 return false;
		 return q.val==p.val&&isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
	 }