LeetCode100——sameTree

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
		if(p==null&&q==null)
			return true;
		if(p!=null&&q!=null&&p.val==q.val)
		{
			return isSameTree(p.left, q.left)&&isSameTree(p.right, q.right);
		}
    	return false;
    }
}
解题思路:树经常用到递归的思想

猜你喜欢

转载自blog.csdn.net/ustcyy91/article/details/80057540
今日推荐