1. 程式人生 > >LeetCode基礎--二叉樹-判斷兩個樹是否相同

LeetCode基礎--二叉樹-判斷兩個樹是否相同

遞迴實現:

public class Solution {
    public bool 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
IsSameTree(p.left, q.left) && IsSameTree(p.right, q.right); } return false; } }