Invert a binary tree.
4 / \ 2 7 / \ / \ 1 3 6 9to
4 / \ 7 2 / \ / \ 9 6 3 1====================================================================================
题目链接:https://leetcode.com/problems/invert-binary-tree/
题目大意:求一个二叉树的逆序二叉树,即将每层翻转。
思路:递归计算,头结点的左子树变成右子树,右子树变成左子树。
附上代码:
/**
* 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 )
return root ;
TreeNode* temp = invertTree ( root -> left ) ;
root -> left = invertTree ( root -> right ) ;
root -> right = temp ;
return root ;
}
};