LeetCode 100. Same Tree

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Nothing special as long as understand tree structure.

    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(!p && !q) return true;
        if((!p && q) || (p && !q) || (p->val != q->val)) return false; 
        return isSameTree(p->right, q->right) && isSameTree(p->left, q->left);
    }