翻转一棵二叉树。
示例:
输入:
4 / \ 2 7 / \ / \ 1 3 6 9
输出:
4 / \ 7 2 / \ / \ 9 6 3 1
思路:前序遍历树的每一个节点,如果遍历到的节点有子节点,就交换它的两个子节点。交换完所有非叶子节点的左右节点后,就得到了树的镜像。
/**
* 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:
TreeNode* invertTree(TreeNode* root) {
if(root == NULL || (root->left == NULL && root->right == NULL)) return root;
TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
if(root->left) root->left = invertTree(root->left);
if(root->right) root->right = invertTree(root->right);
return root;
}
};