How to judge whether the binary tree is symmetrical or not

This article is about how to judge whether the binary tree is symmetrical or not. The editor thinks it is very practical, so I hope you can get something after reading this article. Let's take a look at it with the editor.

Determine whether a given binary tree is symmetrical, axisymmetric.

The left and right subtrees are traversed at the same time, if there is inconsistency, it means asymmetry.

Struct Node {Node * left; Node * right; Node () {left = right = NULL;}}; bool Judge (Node * leftRoot, Node * rightRoot) {if (leftRoot! = NULL & & rightRoot! = NULL) {if (Judge (leftRoot- > left, rightRoot- > right) & & Judge (leftRoot- > right, rightRoot- > left) return true Else return false;} else if (leftRoot = = NULL & & rightRoot = = NULL) {return true;} else {return false;}} bool JudgeTree (Node * root) {if (root = = NULL) return true; return Judge (root- > left, root- > right) } the above is how to judge whether the binary tree is symmetrical or not. The editor believes that there are some knowledge points that we may see or use in our daily work. I hope you can learn more from this article. For more details, please follow the industry information channel.