相同的树 · 交互式算法学习

这是一组同题正确实现，独立于上方当前动画方法；不同语言可能采用另一种正确策略。

1/**2 * Definition for a binary tree node.3 * public class TreeNode {4 *     int val;5 *     TreeNode left;6 *     TreeNode right;7 *     TreeNode() {}8 *     TreeNode(int val) { this.val = val; }9 *     TreeNode(int val, TreeNode left, TreeNode right) {10 *         this.val = val;11 *         this.left = left;12 *         this.right = right;13 *     }14 * }15 */16class Solution {17    public boolean isSameTree(TreeNode p, TreeNode q) {18        if (p == q) return true;19        if (p == null || q == null || p.val != q.val) return false;20        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);21    }22}