[leetcode]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 SameTree { //java
	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 || q.val != p.val)
			 return false;
		 
		 boolean lsame = isSameTree(p.left, q.left);
		 boolean rsame = isSameTree(p.right, q.right);
		 
		 return lsame&&rsame;
	 }
	 
	 
}

[leetcode]Same Tree

原文：http://blog.csdn.net/chenlei0630/article/details/40514859