力扣 简单 100.相同的树

题目介绍

解法

采用递归的思想

class Solution {public boolean isSameTree(TreeNode p, TreeNode q) {if(p == null || q == null){return p == q; // 必须都是 null才返回true}return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);}
}