题目描述:
翻转一颗二叉树:
题解:
class Solution
{
public:
TreeNode* invertTree(TreeNode* root)
{
invert(root);
return root;
}
void invert(TreeNode* head)
{
if (head == NULL)
return;
invert(head->left);
invert(head->right);
TreeNode *temp = head->left;
head->left = head->right;
head->right = temp;
}
};
解题思路:
后序遍历结构,交换左右节点。