LeetCode Everyday –226
Invert a 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;
temp = invertTree(root->left);
root->left = invertTree(root->right);
root->right = temp;
return root;
}
};
说一下我的思路,题目为反转二叉树,将树的每个节点的左右节点互换就好了,是不是很简单呢。所以,通过递归方法遍历每个节点,将每个节点左右子节点互换。