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 {
	public boolean isSameTree(TreeNode p, TreeNode q) {
		if (p == null && q == null) {
			return true;
		}
		if (p == null || q == null || p.val != q.val) {
			return false;
		}
		return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
	}
}

LeetCode | Same Tree,布布扣,bubuko.com

LeetCode | Same Tree

原文：http://blog.csdn.net/perfect8886/article/details/20247007