same binary tree

gistfile1.cpp

/*
  struct TreeNode {
      int value;
      TreeNode *left;
      TreeNode *right;
      TreeNode(int x) : val(x), left(NULL), right(NULL) {}
  };
 */
bool isSameTree(TreeNode *p, TreeNode *q) {
        //both empty, OK
        if (!p && !q)
            return true;
        
        //if only single empty, No
        if (!p )
            return false;
        if (!)q
            return false;
            
        //now both are not empty
        if (p->value != q->value)
            return false;
        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
    }