3.14 leetcode相同的树

类似题:判断树是否对称
时间复杂度：O(min(m,n))
深度优先搜索

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {

		return check(p, q);
	}
	
	public boolean check(TreeNode p, TreeNode q)
	{
		if(p == null && q == null)
		{
			return true;
		}
		if(p == null || q == null)
        {
			return false;
		}

		return (p.val == q.val) && check(p.left, q.left) && check(p.right, q.right);
	}
}

广度优先，做法同上

class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {

		return check(p, q);
	}
	
	public boolean check(TreeNode p, TreeNode q)
	{
		Queue<TreeNode> op = new LinkedList<TreeNode>();
        Queue<TreeNode> oq = new LinkedList<TreeNode>();
        op.offer(p);
        oq.offer(q);
        while(!op.isEmpty() && !oq.isEmpty())
        {
            p = op.poll();
            q = oq.poll();
            if(p == null && q == null){
                continue;
            }
            if((p == null || q == null) || (p.val != q.val))
            {
                return false;
            }

            op.offer(p.left);
            oq.offer(q.left);

            op.offer(p.right);
            oq.offer(q.right);
        }
        return true;

	}
}