Write a function that checks whether two binary trees are mirrors of each other

---

Difficulty level

---

This exercise is mostly suitable for LEVEL 3 students

---

int check_mirrors(Btree B, Btree C)
{
    if(!B && !C) return 1;
    if(!B || !C) return 0;
    if(B->data != C->data) return 0;
    return check_mirrors(B->left,C->right) && check_mirrors(B->right, C->left);
}

---

Click here for more Recursive function exercises! Click here for more Recursion exercises! Click here for more Binary trees exercises! Back to the list of exercises

---

Looking for a more challenging exercise, try this one !!
Recursively reverse a stack

Mistakes may occur. If, while solving, you come across any mistakes with the codes, please, don't hesitate to contact me so that we may correct it together, creating a better programming community.
All proposed suggestions are most welcomed. !!!