问题描述:翻转一棵二叉树。
样例
1 1
/ \ / \
2 3 => 3 2
/ \
4 4
思路:创建新链表temp用来储存root的左子树或右子树,根节点左节点变成右节点,右节点变成左节点。
然后一层层递归下去。
代码:/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: a TreeNode, the root of the binary tree
* @return: nothing
*/
void invertBinaryTree(TreeNode *root) {
// write your code here
if(root==NULL) return;
else{TreeNode *temp;
temp=root->left;
root->left=root->right;
root->right=temp;
invertBinaryTree(root->left);
invertBinaryTree(root->right);
}
}
};