🌗 100. 相同的树

难度: 🌗

问题描述

---

解法

/**
 * 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 mySol(p, q);
    }

    private boolean mySol(TreeNode a, TreeNode b) {
        // 递归终止条件
        if(a == null) {
            return b == null;
        }
        if(b == null) {
            return a == null;
        }
        // a != null && b != null
        if(a.val != b.val) {
            return false;
        }
        return mySol(a.left, b.left) && mySol(a.right, b.right);
    }
}

---

输出