LeetCode——Same Tree

最新推荐文章于 2018-05-28 16:43:22 发布

原创最新推荐文章于 2018-05-28 16:43:22 发布 · 317 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode——坚持每天一题专栏收录该内容

176 篇文章

订阅专栏

本文介绍了一种用于判断两个二叉树是否完全相同的算法。该算法通过递归方式比较两个二叉树的结构及节点值来确定它们是否一致。

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.

Java代码：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
		if (p == null && q == null)
			return true;
		if(p==null ||q==null)return false;
		//if(p.left ==null && q.left==null)return true;
		if(p.val == q.val)
		{
			if(isSameTree(p.left, q.left) && isSameTree(p.right, q.right))
				return true;
			else
				return false;
		}
		else{
			return false;
		}
    }
}