输入一个二叉树,将它变换为它的镜像。
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: void mirror(TreeNode* root) { if (!root) return; mirror (root->left); mirror (root->right); swap (root->left, root->right); } };
标签:right,TreeNode,二叉树,mirror,镜像,root,left From: https://www.cnblogs.com/leetothemoon/p/16983905.html