LeetCode Algorithm #226: Invert Binary Tree
Problem
Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
Solution
对于这个问题的第一反应就是用递归算法解决,首先交换根节点的左右子树,再对左右子树递归交换。
递归的终止条件是当前节点为NULL.
Code (C++)
/**
* 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) return root;
TreeNode * tmp = root->left;
root->left = invertTree(root->right);
root->right = invertTree(tmp);
return root;
}
};
Summary
刷LeetCode之路第一题,加油。