问题描述
https://leetcode.com/problems/same-tree/
解决思路
递归遍历树就可以，比较简单。
代码
/**
* 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) return false;
if(p.val != q.val){
return false;
}else{
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
}
}
复杂度分析
- 时间复杂度：O(2^n)
- 空间复杂度：O(1)
