您的位置:首页 > 其它

LeetCode Same Tree 100

2016-04-23 19:56 232 查看
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.

/**

* Definition for a binary tree node.

* 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;

else if(p==null && q!=null) return false;

else if(p!=null && q==null) return false;

else{

if(p.val == q.val){

return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);

}

else return false;

}

}

}


java练手中~~~
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: