镜像树,如图
思路:
利用递归的思想,如果一颗树有左右节点,则进行交换,有一个节点为空则退出递归
struct BinaryTreeNode { int val; BinaryTreeNode* left; BinaryTreeNode* right; };
void mirrorRecursively(BinaryTreeNode* pNode) { if (pNode->left == NULL || pNode->right == NULL) { return; } BinaryTreeNode* temp = pNode->left; pNode->left = pNode->right; pNode->right = temp; mirrorRecursively(pNode->left); mirrorRecursively(pNode->right); }