Same Tree

07/11/2016 Tree Depth First Search


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.


Result: Accepted Time: 0 ms

Here should be some explanations.

bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
    if(p && q && p->val == q->val)
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    return p == q;

Complexity Analytics

  • Time Complexity:
  • Space Complexity: